The structure theorem for sets of lengths for numerical semigroups
From MaRDI portal
Cites work
- A realization result for systems of sets of lengths
- A realization theorem for sets of distances
- A realization theorem for sets of lengths
- A realization theorem for sets of lengths in numerical monoids
- A structure theorem for sets of lengths
- Beyond Coins, Stamps, and Chicken McNuggets: An Invitation to Numerical Semigroups
- Characterization of class groups of Krull monoids via their systems of sets of lengths: a status report.
- Computation of delta sets of numerical monoids.
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- Delta sets of numerical monoids are eventually periodic.
- Factorization invariants in numerical monoids
- Finite abelian groups and factorization problems
- Fundamental gaps in numerical semigroups.
- Gaps in nonsymmetric numerical semigroups.
- Goppa-like bounds for the generalized Feng-Rao distances.
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- Huneke-Wiegand conjecture for complete intersection numerical semigroup rings.
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- Numerical semigroups and applications
- Numerical semigroups: Apéry sets and Hilbert series.
- On arithmetical numerical monoids with some generators omitted
- On delta sets and their realizable subsets in Krull monoids with cyclic class groups.
- ON DELTA SETS OF NUMERICAL MONOIDS
- On dynamic algorithms for factorization invariants in numerical monoids
- On factorization invariants and Hilbert functions
- On the computation of the Apéry set of numerical monoids and affine semigroups
- On the linearity of \(\omega\)-primality in numerical monoids.
- On the set of elasticities in numerical monoids
- On the value set of 1-forms for plane branches
- On the Weight Hierarchy of Codes Coming From Semigroups With Two Generators
- Power monoids: a bridge between factorization theory and arithmetic combinatorics
- Sets of lengths
- Sets of lengths do not characterize numerical monoids.
- Structural properties of subadditive families with applications to factorization theory
- The catenary and tame degrees on a numerical monoid are eventually periodic
- The computation of factorization invariants for affine semigroups
- The realization problem for delta sets of numerical semigroups
- The second Feng-Rao number for codes coming from telescopic semigroups
- The set of distances in Krull monoids
Cited in
(2)
This page was built for publication: The structure theorem for sets of lengths for numerical semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977114)