Computing toric ideals
DOI10.1006/JSCO.1998.0256zbMATH Open0958.13009OpenAlexW2032652757MaRDI QIDQ1283192FDOQ1283192
Authors: Anna M. Bigatti, Roberto La Scala, Lorenzo Robbiano 
Publication date: 2 January 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1998.0256
Recommendations
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]toric idealbinomial ideals
Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cited In (35)
- Saturations of subalgebras, SAGBI bases, and U-invariants
- Factorizations of the same length in abelian monoids
- On selection of nonmultiplicative prolongations in computation of Janet bases
- Computing lattice ideals of unions of monomial curves
- Lattice polly cracker cryptosystems
- Combinatorial mutations and block diagonal polytopes
- Computing generating sets of lattice ideals and Markov bases of lattices
- Algebraic Markov Bases and MCMC for Two‐Way Contingency Tables
- Markov bases and structural zeros
- Indispensable binomials in semigroup ideals
- Critical binomial ideals of Northcott type
- Examples of Generic Lattice Ideals of Codimension 3
- Normal toric ideals of low codimension
- The Artin component and simultaneous resolution via reconstruction algebras of type \(A\)
- Markov bases and subbases for bounded contingency tables
- FIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCE
- On ideal lattices, Gröbner bases and generalized hash functions
- The norm of the saturation of a binomial ideal, with applications to Markov bases
- Border bases for lattice ideals
- Algebraic exact inference for rater agreement models
- A saturation algorithm for homogeneous binomial ideals
- A class of statistical models to weaken independence in two-way contingency tables
- Generalized reduction to compute toric ideals
- Binomial fibers and indispensable binomials
- Computing the degree of a lattice ideal of dimension one
- Title not available (Why is that?)
- Computation of Janet bases for toric ideals
- Toric ideals and their circuits
- Generalized reduction to compute toric ideals
- Computing inhomogeneous Gröbner bases
- Koszul algebras and computations
- Gröbner based for submodules of \(\mathbb Z^n\)
- Minimal generating sets of lattice ideals
- Computing zero-dimensional schemes
- On the equations defining toric l.c.i.-singularities
Uses Software
This page was built for publication: Computing toric ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283192)
