Indispensable monomials of toric ideals and Markov bases

DOI10.1016/J.JSC.2007.07.012MaRDI QIDQ932801zbMATHOpenAlexFDO

Authors Satoshi Aoki, Akimichi Takemura, Ruriko Yoshida

Publication date 11 July 2008

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

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 417275 (Why is no real title available?)
• scientific article; zbMATH DE number 1560708 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• Algebraic Statistics for Computational Biology
• Algebraic algorithms for sampling from conditional distributions
• Compressed polytopes and statistical disclosure limitation
• Distance-reducing Markov bases for sampling from a discrete sample space
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals
• Parametric inference for biological sequence analysis
• Solving the likelihood equations
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Testing Statistical Hypotheses

Cited in

(19)

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

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)