Universally free numerical semigroups
From MaRDI portal
Abstract: A numerical semigroup is said to be universally free if it is free for any possible arrangement of its minimal generating set. In this work, we establish that toric ideals associated with universally free numerical semigroups can be generated by their set of circuits. Additionally, we provide a characterization of universally free numerical semigroups in terms of Gr"obner bases. Specifically, a numerical semigroup is universally free if and only if all initial ideals of its corresponding toric ideal are complete intersections. Furthermore, we establish several equalities among the toric bases of a universally free numerical semigroup. We provide a complete characterization of -generated universally free numerical semigroups in terms of their minimal generating sets, and by proving the equality of certain toric bases. We compute exactly all the toric bases of a toric ideal defined by a 3-generated universally free numerical semigroup. Notably, we answer some questions posed by Tatakis and Thoma by demonstrating that toric ideals defined by -generated universally free numerical semigroups have a set of circuits and a universal Gr"obner basis of size 3, while the universal Markov basis and the Graver basis can be arbitrarily large. We present partial results and propose several conjectures regarding universally free numerical semigroups with more than three generators.
Recommendations
Cites work
- 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.
Cited in
(5)
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)
