Indispensable monomials of toric ideals and Markov bases

DOI10.1016/J.JSC.2007.07.012zbMATH Open1170.13008arXivmath/0511290OpenAlexW2024331645MaRDI QIDQ932801FDOQ932801

Authors: Satoshi Aoki, Akimichi Takemura, Ruriko Yoshida 

Publication date: 11 July 2008

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: Extending the notion of indispensable binomials of a toric ideal, we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for proving the existence or non-existence of a unique minimal system of binomials generators of a toric ideal. Some examples of indispensable monomials from statistical models for contingency tables are given.

Full work available at URL: https://arxiv.org/abs/math/0511290

Recommendations

• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Indispensable binomials in semigroup ideals
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS
• Markov complexity of monomial curves
• Binomial fibers and indispensable binomials

zbMATH Keywords

contingency tablesMarkov-chain Monte Carloconditional testsmonomialstoric idealsbinomialsMarkov basesGröbner bases

Mathematics Subject Classification ID

Applications of graph theory (05C90) Contingency tables (62H17) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Cites Work

• Testing Statistical Hypotheses
• Title not available (Why is that?)
• Algebraic Statistics for Computational Biology
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic algorithms for sampling from conditional distributions
• Parametric inference for biological sequence analysis
• Solving the likelihood equations
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS
• Title not available (Why is that?)
• Non-very ample configurations arising from contingency tables
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Compressed polytopes and statistical disclosure limitation
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals
• Distance-reducing Markov bases for sampling from a discrete sample space

Cited In (20)

• Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
• Markov Bases: A 25 Year Update
• On decomposable semigroups and applications.
• Markov complexity of monomial curves
• On the generalized Scarf complex of lattice ideals
• On robustness and related properties on toric ideals
• Non-very ample configurations arising from contingency tables
• Combinatorial degree bound for toric ideals of hypergraphs
• Indispensable binomials in semigroup ideals
• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Isolated factorizations and their applications in simplicial affine semigroups
• Markov bases for two-way subtable sum problems
• Binomial fibers and indispensable binomials
• Minimal generators of toric ideals of graphs
• Markov bases and toric ideals for some contingency tables
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• The largest group of invariance for Markov bases and toric ideals
• Minimal generating sets of lattice ideals
• Numerical investigation on feedback control of flow around an oscillating hydrofoil by Lorentz force
• A short history of algebraic statistics

This page was built for publication: Indispensable monomials of toric ideals and Markov bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932801)