Minimal generating sets of lattice ideals
From MaRDI portal
Publication:2404863
DOI10.1007/s13348-017-0191-9zbMath1371.05324arXiv1303.2303OpenAlexW3102856587MaRDI QIDQ2404863
Hara Charalambous, Apostolos Thoma, Marius Vladoiu
Publication date: 21 September 2017
Published in: Collectanea Mathematica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.2303
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Linkage, complete intersections and determinantal ideals (13C40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial aspects of commutative algebra (05E40)
Related Items
On the relative size of toric bases ⋮ Bouquet algebra of toric ideals ⋮ Factorizations of the same length in abelian monoids ⋮ Markov bases and generalized Lawrence liftings ⋮ The Markov complexity of book graphs ⋮ On robustness and related properties on toric ideals ⋮ Hypergraph encodings of arbitrary toric ideals ⋮ Minimal set of binomial generators for certain Veronese 3-fold projections
Uses Software
Cites Work
- Unnamed Item
- Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs
- Markov complexity of monomial curves
- Decompositions of commutative monoid congruences and binomial ideals.
- Computing generating sets of lattice ideals and Markov bases of lattices
- A finiteness theorem for Markov bases of hierarchical models
- Markov bases and generalized Lawrence liftings
- Binomial fibers and indispensable binomials
- Indispensable monomials of toric ideals and Markov bases
- Lectures on algebraic statistics
- Affine torus embeddings which are complete intersections
- Relative invariants of finite groups generated by pseudoreflections
- On regular sequences of binomials
- Computing toric ideals
- Minimal systems of generators for ideals of semigroups
- Higher Lawrence configurations.
- Complete intersection lattice ideals
- Algebraic algorithms for sampling from conditional distributions
- Gröbner bases of lattices, corner polyhedra, and integer programming
- Binomial ideals
- Combinatorics of binomial primary decomposition
- Generators and relations of abelian semigroups and semigroup rings
- Non-very ample configurations arising from contingency tables
- COMPLETE INTERSECTIONS IN BINOMIAL AND LATTICE IDEALS
- Indispensable binomials in semigroup ideals
- Sous-monoïdes d'intersection complète de $N$
- Affine semigroup rings that are complete intersections
- Generic lattice ideals
- Combinatorial Commutative Algebra
- On complete intersection affine semigroups
- Degree and Algebraic Properties of Lattice and Matrix Ideals
- GRIN: An implementation of Gröbner bases for integer programming
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
