Forms the multiplication table.
More...
#include <Mult_Table.hpp>
|
| MultTable (const MultTableData< group_t > &MTD) |
| Constructs multiplication table given the fundamental data (say after serialization) More...
|
|
| MultTable (MultTableData< group_t > &&MTD) |
| Constructs multiplication table given the fundamental data (say after serialization) More...
|
|
| MultTable (int, const std::vector< int > &, const std::vector< int > &, const std::vector< std::vector< int >> &) |
| Constructs the multiplication table given the maximum and minimum spheres and the basic irreducibles. More...
|
|
int | getdegreeindex (const std::vector< int > &) const |
| Retrieve the degree index of the given degree. Returns -1 if no such degree can be found. More...
|
|
bool | degreewithinrange (const std::vector< int > &) const |
| Checks if given degree is within the computed range. More...
|
|
Green< group_t > | triple_product (int i, int j1, int j2) const |
|
|
std::vector< int > | getsphere (const std::vector< int > °) const |
| Isolate sphere from the degree vector (i.e. get everything but first entry) More...
|
|
|
int | level |
| The Mackey functor level we are working in ///. More...
|
|
std::map< std::vector< int >, IDGenerators< typename group_t::rank_t > > | NonZeroHomology |
|
std::vector< std::vector< Green< group_t > > > | Greens |
| Each entry in the multiplication table. More...
|
|
std::map< std::array< int, 3 >, Green< group_t > > | tripleGreens |
| Triple products used when all other identification methods fail. More...
|
|
std::vector< std::vector< int > > | degree |
| Maps each index to the corresponding degree. More...
|
|
std::map< std::vector< int >, int > | antidegree |
| Maps each degree to the corresponding index. More...
|
|
Eigen::Matrix< int, -1, -1 > | index_product |
| Maps each index and irreducible to the index of their product. More...
|
|
std::vector< int > | minsphere |
| The lower bound on the range of our spheres. More...
|
|
std::vector< int > | maxsphere |
| The upper bound on the range of our spheres. More...
|
|
std::vector< std::vector< int > > | basicIrreducibles |
| The basic irreducibles we use to produce the factorizations (eg Euler and orientation classes) More...
|
|
template<typename group_t>
class mackey::MultTable< group_t >
Forms the multiplication table.
◆ MultTable() [1/3]
Constructs multiplication table given the fundamental data (say after serialization)
◆ MultTable() [2/3]
Constructs multiplication table given the fundamental data (say after serialization)
◆ MultTable() [3/3]
MultTable |
( |
int |
, |
|
|
const std::vector< int > & |
, |
|
|
const std::vector< int > & |
, |
|
|
const std::vector< std::vector< int >> & |
|
|
) |
| |
Constructs the multiplication table given the maximum and minimum spheres and the basic irreducibles.
◆ getdegreeindex()
int getdegreeindex |
( |
const std::vector< int > & |
| ) |
const |
Retrieve the degree index of the given degree. Returns -1 if no such degree can be found.
◆ degreewithinrange()
bool degreewithinrange |
( |
const std::vector< int > & |
| ) |
const |
Checks if given degree is within the computed range.
- Returns
- 1 if it's in range and 0 otherwise
◆ triple_product()
Green<group_t> triple_product |
( |
int |
i, |
|
|
int |
j1, |
|
|
int |
j2 |
|
) |
| const |
◆ getsphere()
std::vector<int> getsphere |
( |
const std::vector< int > & |
deg | ) |
const |
|
protected |
Isolate sphere from the degree vector (i.e. get everything but first entry)
The documentation for this class was generated from the following file: