On Ideals of Submonoids of Power Monoids
Open Access
- 10 February 2025
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 13 (4) , 584
Abstract
Let be a numerical monoid, while a -monoid S is a monoid generated by a finite number of finite non-empty subsets of . That is, S is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. This work provides an algorithm for computing the ideals associated with some -monoids. These are the key to studying some factorization properties of -monoids and some additive properties of sumsets. This approach links computational commutative algebra with additive number theory.
Keywords
Funding Information
- MICIU/AEI/10.13039/501100011033 (PID2022-138906NB-C21)
This publication has 16 references indexed in Scilit:
- The Buchweitz Set of a Numerical SemigroupBulletin of the Brazilian Mathematical Society, New Series, 2022
- Power monoids: A bridge between factorization theory and arithmetic combinatoricsJournal of Algebra, 2018
- A characterization of arithmetical invariants by the monoid of relationsSemigroup Forum, 2010
- Elastic Properties and Prime ElementsResults in Mathematics, 2006
- N-solutions to linear systems over ZLinear Algebra and its Applications, 2004
- Atomic Commutative Monoids and Their ElasticitySemigroup Forum, 2003
- PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDSInternational Journal of Algebra and Computation, 2002
- Hereditarily Finitely Generated Commutative MonoidsJournal of Algebra, 1999
- ON PRESENTATIONS OF COMMUTATIVE MONOIDSInternational Journal of Algebra and Computation, 1999
- Generators and relations of abelian semigroups and semigroup ringsmanuscripta mathematica, 1970