12 problems
Let be a numerical monoid, meaning a cofinite additive submonoid of the non-negative integers . Let be the monoid of finite subsets…
Let and be numerical monoids, and let and denote their reduced finitary power monoids, consi…
Fan–Tringali conjecture. Every nonempty finite subset of occurs as a length set in each of the power monoids and…
Let be the monoid of finite subsets of the additive group containing , with setwise addition. Tringali–Wen's conjecture. The…
Let the reduced finitary power monoid of the additive group be the quotient of the finitary power monoid by translation equivalence, and let denote t…
Let be a numerical monoid, and for let be the number of -element atoms of whose maximum is at most .…
Let be a class of finite monoids, and for a monoid write the system of length sets of for the collection of all its length sets. F…
Let be a monoid that is not torsion, and let be its finitary power monoid containing the identity. A length set is the set of factorization len…
A numerical monoid is a submonoid of such that is finite. Let the reduced power monoid of be the reduced power monoid associated…
Let and be numerical monoids. For a numerical monoid , let denote the power monoid of finite subsets of containing . Isomorphism…
Let be the monoid of finite nonempty subsets of under sumset addition, where … For an element of this monoid, let…
Power-monoid sets-of-lengths conjecture. The systems of sets of lengths of and contain every non-empty finite subset of…