Page Beneath the surface

Further explore/improve the equivariant AMT algorithm.

Class CombinationGenerator< T >

Implement via coroutine (C++20)

Page Extensions

Implement all \(G=C_{p^n}\)

Support arbitrary cyclic groups by using a subgroup diagram-tree for transfers and restrictions

Support general finite abelian groups

Support non constant coefficients such as Burnside ring coefficients \(A_{\mathbf Z}\)

Class FactoryGenerator< spec_t, gen_t >

Implement as coroutine (C++20)

Page From Math to Code

Make identification work even if there is more than one \(\mathbf Z\) factor (so we get infinitely many automorphisms)

Implement Frobenius relations: The multiplicative structure is computed levelwise, but this could be done more effectively using the Frobenius relations

Namespace mackey::SFINAE

Replace with concepts

Class PermutationGenerator< T >

Implement via coroutine (C++20)