Universally free numerical semigroups
Let \(A = \{a_1,..., a_n\}\) be a set of relatively prime positive integers and let \(S\) be the numerical semigroup generated by \(A\). The set \(A\) is said to be the minimal generating set of \(S\) if no proper subset of \(A\) generates \(S\). A numerical semigroup \(S\) with minimal generating set \(A = \{a_1,..., a_n\}\) is said to be free for the arrangement \((a_1,..., a_n)\) if \( \mathrm{lcm}(a_i , \mathrm {gcd}(a_{i+1},...,a_n))\in \langle a_{i+1},...,a_n\rangle\) for all \(i \in \{1,...,n - 1\}\). A numerical semigroup \(S\) is called universally free, if it is free for any arrangement of its minimal generating set. The paper contains many results concerning universally free numerical semigroups and toric ideals associated with them. The authors present a complete characterization of \(3\)-generated universally free numerical semigroups in terms of their minimal generating sets. The paper contains many examples. Here is one of the results: ``Let \(S\) be a numerical semigroup with minimal generating set \(A = \{a_1,..., a_n\}\). Then, \(S\) is universally free if and only if every reduced Gröbner basis of \(I_A\) has \(n -1\) elements.
- Algebraic algorithms for sampling from conditional distributions
- An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
- An indispensable classification of monomial curves in \(\mathbb{A}^4(k)\)
- Binomial ideals
- Classes of complete intersection numerical semigroups.
- Constructing the set of complete intersection numerical semigroups with a given Frobenius number.
- Critical binomials of monomial curves
- Generalized robust toric ideals
- Generators and relations of abelian semigroups and semigroup rings
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- Hypergraph encodings of arbitrary toric ideals
- Isolated factorizations and their applications in simplicial affine semigroups
- Markov bases and generalized Lawrence liftings
- Minimal generators of toric ideals of graphs
- Monomial algebras
- Numerical semigroups, polyhedra, and posets. II: Locating certain families of semigroups
- Numerical semigroups.
- On robustness and related properties on toric ideals
- On the occurrence of complete intersections in shifted families of numerical semigroups
- On the relative size of toric bases
- On the universal Gröbner bases of toric ideals of graphs
- Robust toric ideals
- Semi-groupes d'entiers et application aux branches
- Sous-monoïdes d'intersection complète de N
- Strongly robust toric ideals in codimension 2
- The circuit ideal of a vector configuration
- The minimum distance of codes in an array coming from telescopic semigroups
- Toric ideals generated by circuits
- Toric varieties
- Uniquely presented finitely generated commutative monoids.
This page was built for publication: Universally free numerical semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146468)
