Factorization invariants in numerical monoids
From MaRDI portal
Publication:2979658
DOI10.1090/conm/685/13713zbMath1360.05130arXiv1508.00128OpenAlexW2278857362MaRDI QIDQ2979658
Roberto Pelayo, Christopher O'Neill
Publication date: 25 April 2017
Published in: Algebraic and Geometric Methods in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.00128
Related Items
Factorization length distribution for affine semigroups IV: a geometric approach to weighted factorization lengths in three-generator numerical semigroups ⋮ FACTORIZATION LENGTH DISTRIBUTION FOR AFFINE SEMIGROUPS III: MODULAR EQUIDISTRIBUTION FOR NUMERICAL SEMIGROUPS WITH ARBITRARILY MANY GENERATORS ⋮ Factorization length distribution for affine semigroups. I: Numerical semigroups with three generators ⋮ Length density and numerical semigroups ⋮ Minimal presentations of shifted numerical monoids ⋮ The computation of factorization invariants for affine semigroups ⋮ Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators ⋮ Apéry sets of shifted numerical monoids ⋮ On the arithmetic of stable domains ⋮ An improved algorithm to compute the \(\omega\)-primality ⋮ \(\omega \)-primality in arithmetic Leamer monoids ⋮ On factorization invariants and Hilbert functions ⋮ Augmented Hilbert series of numerical semigroups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative ideal theory and factorization theory. Commutative and non-commutative perspectives. Selected papers based on the presentations at the meeting `Arithmetic and ideal theory of rings and semigroups', Graz, Austria, September 22--26, 2014
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- On the omega values of generators of embedding dimension-three numerical monoids generated by an interval
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- Factoring in embedding dimension three numerical semigroups
- Delta sets of numerical monoids are eventually periodic.
- An algorithm to compute \(\omega\)-primality in a numerical monoid.
- Numerical semigroups: Apéry sets and Hilbert series.
- Computation of delta sets of numerical monoids.
- On the computation of the Apéry set of numerical monoids and affine semigroups
- Numerical semigroups.
- On the asymptotic behaviour of the number of distinct factorizations into irreducibles
- Arf numerical semigroups.
- On the delta set and the Betti elements of a BF-monoid.
- Numerical semigroups with Apéry sets of unique expression
- On factorization invariants and Hilbert functions
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- When the catenary degree agrees with the tame degree in numerical semigroups of embedding dimension three.
- Delta sets for symmetric numerical semigroups with embedding dimension three
- On the set of elasticities in numerical monoids
- A characterization of class groups via sets of lengths. II.
- The realization problem for delta sets of numerical semigroups
- On the linearity of \(\omega\)-primality in numerical monoids.
- Full elasticity in atomic monoids and integral domains.
- The catenary and tame degree in finitely generated commutative cancellative monoids.
- Measuring primality in numerical semigroups with embedding dimension three
- On the set of catenary degrees of finitely generated cancellative commutative monoids
- Numerical Semigroups on Compound Sequences
- An Overview of the Computational Aspects of Nonunique Factorization Invariants
- The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences
- ON BOUNDING MEASURES OF PRIMENESS IN INTEGRAL DOMAINS
- THE CATENARY AND TAME DEGREES ON A NUMERICAL MONOID ARE EVENTUALLY PERIODIC
- On dynamic algorithms for factorization invariants in numerical monoids
- HOW FAR IS AN ELEMENT FROM BEING PRIME?
- Computing the Continuous Discretely
- ON DELTA SETS OF NUMERICAL MONOIDS
- How Do You Measure Primality?
- The catenary and tame degree of numerical monoids
- On the linear diophantine problem of Frobenius.
- The catenary degrees of elements in numerical monoids generated by arithmetic sequences
- FACTORIZATION INVARIANTS IN HALF-FACTORIAL AFFINE SEMIGROUPS
- A characterization of class groups via sets of lengths
- numericalsgps, a GAP package for numerical semigroups
