Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\)
From MaRDI portal
Publication:283342
DOI10.1007/s00233-015-9690-8zbMath1384.20047OpenAlexW1996138197WikidataQ60691918 ScholiaQ60691918MaRDI QIDQ283342
Chris Peterson, Rosanna Utano, Gioia Failla
Publication date: 13 May 2016
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-015-9690-8
Nonnumerical algorithms (68W05) Commutative semigroups (20M14) Software, source code, etc. for problems pertaining to group theory (20-04) Semigroups (20M99)
Related Items
The corner element of generalized numerical semigroups ⋮ Characterizing affine \(\mathcal{C}\)-semigroups ⋮ An extension of Wilf's conjecture to affine semigroups ⋮ Atoms of root-closed submonoids of \(\mathbb{Z}^2\) ⋮ Counting Numerical Semigroups ⋮ A geometrical characterization of proportionally modular affine semigroups ⋮ On atoms of the set of generalized numerical semigroups with fixed corner element ⋮ Some properties of affine \({\mathcal{C}}\)-semigroups ⋮ On generalized Wilf conjectures ⋮ A generalization of Wilf's conjecture for generalized numerical semigroups ⋮ Affine semigroups of maximal projective dimension. II ⋮ Algorithms for generalized numerical semigroups ⋮ On almost-symmetry in generalized numerical semigroups ⋮ Irreducible generalized numerical semigroups and uniqueness of the Frobenius element ⋮ Frobenius allowable gaps of generalized numerical semigroups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Constructing the set of complete intersection numerical semigroups with a given Frobenius number.
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- On the enumeration of the set of numerical semigroups with fixed Frobenius number.
- The Frobenius problem for numerical semigroups
- On the variety of linear recurrences and numerical semigroups
- Improved bounds on the number of numerical semigroups of a given genus
- Constructing numerical semigroups of a given genus.
- Bounds on the number of numerical semigroups of a given genus
- Numerical semigroups.
- On finitely generated submonoids of \(\mathbb{N}^ k\)
- Genus of numerical semigroups generated by three elements.
- \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)
- The set of numerical semigroups of a given genus.
- Fibonacci-like growth of numerical semigroups of a given genus.
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Towards a better understanding of the semigroup tree
- Two-Generator Numerical Semigroups and Fermat and Mersenne Numbers
- COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS
- On numerical semigroups
