Computing generating sets of lattice ideals and Markov bases of lattices
From MaRDI portal
Publication:840713
Abstract: In this article, we present a new algorithm for computing a generating set of a lattice ideal. This algorithm is based on a project-and-lift approach and is implemented in 4ti2. We also include a computational comparison of several existing implementations to compute such generating sets.
Recommendations
Cites work
- A Geometric Buchberger Algorithm for Integer Programming
- Algebraic algorithms for sampling from conditional distributions
- An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
- Computing toric ideals
- Decomposition of integer programs and of generating sets
- Efficiently computing minimal sets of critical pairs
- GRIN: an implementation of Gröbner bases for integer programming
- Gröbner bases of lattices, corner polyhedra, and integer programming
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 177867 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Minimal solutions of linear diophantine systems : bounds and algorithms
- On an installation of Buchberger's algorithm
- On the foundations of linear and integer linear programming I
- On the positive sums property and the computation of Graver test sets
- Test sets and inequalities for integer programs
- Toric ideals of homogeneous phylogenetic models
- Variation of cost functions in integer programming
Cited in
(27)- A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
- Minimal set of binomial generators for certain Veronese 3-fold projections
- Two variations of graph test in double description method
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
- Minimal generating sets of lattice ideals
- Heat-bath random walks with Markov bases
- On decomposable semigroups and applications.
- Random sampling in computational algebra: Helly numbers and violator spaces
- An algorithm for solving parametric integer program
- Equivariant lattice generators and Markov bases
- Generalized reduction to compute toric ideals
- Markov complexity of monomial curves
- Computing Gröbner bases of pure binomial ideals via submodules of Z^n
- Support sets in exponential families and oriented matroid theory
- A study of a family of monomial ideals
- Factorizations of the same length in abelian monoids
- Linear label code of a root lattice using Gröbner bases
- \textsc{Sagbi} combinatorics of maximal minors and a \textsc{Sagbi} algorithm
- Computing the binomial part of a polynomial ideal
- Conditional inference given partial information in contingency tables using Markov bases
- Reconstructing biochemical cluster networks
- Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems
- Title not available (Why is no real title available?)
- Toric geometry of cuts and splits
- Markov bases and generalized Lawrence liftings
- Lifting Markov bases and higher codimension toric fiber products
- Binomial fibers and indispensable binomials
This page was built for publication: Computing generating sets of lattice ideals and Markov bases of lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840713)
