Asymptotic behavior of Markov complexity

DOI10.1016/J.JPAA.2023.107589MaRDI QIDQ6199053zbMATH OpenOpenAlexFDO

Authors Shmuel Onn, Apostolos Thoma, Marius Vladoiu

Publication date 23 February 2024

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpaa.2023.107589

zbMATH Keywords

Graver basisLawrence liftingsMarkov complexitytoric ideals

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Matrices of integers (15B36) Algebraic statistics (62R01)

Recommendations

• Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
• On the Graver complexity of codimension \(2\) matrices
• Lower bounds on the graver complexity of M-fold matrices
• A finiteness theorem for Markov bases of hierarchical models
• On the Gröbner complexity of matrices

Cites work

• A finiteness theorem for Markov bases of hierarchical models
• A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• Algebraic algorithms for sampling from conditional distributions
• Bouquet algebra of toric ideals
• Higher Lawrence configurations.
• Hypergraph encodings of arbitrary toric ideals
• Lectures on algebraic statistics
• Lower bounds on the graver complexity of M-fold matrices
• Markov bases and generalized Lawrence liftings
• Markov bases of three-way tables are arbitrarily complicated
• Markov complexity of monomial curves
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Nonlinear discrete optimization. An algorithmic theory
• On the strongly robust property of toric ideals
• Sparse integer programming is FPT
• Sparsity. Graphs, structures, and algorithms
• The Graver complexity of integer programming
• The Markov complexity of book graphs
• Tight complexity lower bounds for integer linear programming with few constraints
• Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)

This page was built for publication: Asymptotic behavior of Markov complexity

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