Betti-element count distinguishes finite abelian groups via block monoids
Betti-element count distinguishes finite abelian groups via block monoids
Let be a finite abelian group, and let be the free abelian monoid on . Define
and let
be the block monoid on . The Betti elements of an affine monoid are the elements whose factorization graph is disconnected. Betti-element count conjecture. Let and be finite abelian groups of order greater than . Apart from and , if , then the numbers of Betti elements of and are different. Computations suggest that the number of Betti elements grows rapidly with the size of , but the conjectured distinction between all nonisomorphic groups beyond the stated exceptions remains unproved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Scott T. Chapman, Pedro García-Sánchez, Christopher O'Neill and Vadim Ponomarenko, “Betti elements and full atomic support in rings and monoids”, arXiv:2502.17895 (2025).
Additional references
2 papers in this index state this conjecture (2021–2025). The statement above is taken from the most recent of them; the others are arXiv:2101.08826.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.