The Formal Context of Saturated Transfer Systems on Finite Abelian Groups
Seth Bernstein, Ben Spitz

TL;DR
This paper characterizes the formal context of saturated transfer systems on finite abelian groups and computes the total number of such systems for a specific group, revealing the complexity of their structure.
Contribution
It provides a detailed description of the formal context for saturated transfer systems and calculates their total count on a particular finite abelian group, advancing understanding in this area.
Findings
Describes the reduced formal context of saturated transfer systems on finite abelian groups.
Computes over 13 trillion saturated transfer systems for the group C_5^3.
Highlights the combinatorial complexity of transfer systems on finite abelian groups.
Abstract
We describe the reduced formal context of the lattice of saturated transfer systems on a finite abelian group. As an application, we compute that there are 13,784,538,270,571 saturated transfer systems on the elementary abelian group .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsadvanced mathematical theories · Rings, Modules, and Algebras · Mathematical Dynamics and Fractals
