Computing all Markov bases

MaRDI QIDQ7392148zbMATH OpenFDO

Authors Oliver Clarke, Alexander Milner

Publication date 2025

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://www.mat.univie.ac.at/~slc/wpapers/FPSAC2025/160.html

Mathematics Subject Classification ID

Combinatorics (05-XX)

Cites work

• Algebraic algorithms for sampling from conditional distributions
• Algebraic statistics
• Binomial fibers and indispensable binomials
• Computing generating sets of lattice ideals and Markov bases of lattices
• Computing toric ideals
• Distance-reducing Markov bases for sampling from a discrete sample space
• GRIN: an implementation of Gröbner bases for integer programming
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• Markov bases of toric ideals: connecting commutative algebra and statistics
• Markov Bases: A 25 Year Update
• Markov complexity of monomial curves
• Minimal generating sets of lattice ideals
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Neuer Beweis eines Satzes über Permutationen.
• On the strongly robust property of toric ideals
• Strongly robust toric ideals in codimension 2

This page was built for publication: Computing all Markov bases

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