Primary full-system conjecture for finite-rank submonoids
For , let be the class of rank- submonoids of finite-rank free commutative monoids. A monoid has a full system of sets of lengths when its system of sets of lengths is , the collection of all finite subsets of positive integers. A monoid is primary when it has no nonempty proper divisor-closed submonoid.
Primary full-system conjecture. For every dimension , there exists a primary monoid in having full system of sets of lengths.
The preceding construction gives, for every , a rank- monoid with full system of sets of lengths, but that monoid is not primary. The conjecture asks whether primarity can be achieved while retaining the same extremal factorization property.
References
Primary source
Felix Gotti, “On the system of sets of lengths and the elasticity of submonoids of a finite-rank free commutative monoid”, arXiv:1806.11273 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.