Asymptotic behavior of Markov complexity
From MaRDI portal
Publication:6199053
DOI10.1016/j.jpaa.2023.107589OpenAlexW4389937051MaRDI QIDQ6199053
Apostolos Thoma, Marius Vladoiu, Shmuel Onn
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
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Matrices of integers (15B36) Combinatorial aspects of commutative algebra (05E40) Algebraic statistics (62R01)
Cites Work
- Unnamed Item
- Lower bounds on the graver complexity of \(M\)-fold matrices
- Markov complexity of monomial curves
- Sparsity. Graphs, structures, and algorithms
- The Graver complexity of integer programming
- A finiteness theorem for Markov bases of hierarchical models
- Markov bases and generalized Lawrence liftings
- Lectures on algebraic statistics
- Nonlinear discrete optimization. An algorithmic theory
- Higher Lawrence configurations.
- Bouquet algebra of toric ideals
- Algebraic algorithms for sampling from conditional distributions
- Hypergraph encodings of arbitrary toric ideals
- On the strongly robust property of toric ideals
- Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
- A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
- Markov bases of three-way tables are arbitrarily complicated
- The Markov complexity of book graphs
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
This page was built for publication: Asymptotic behavior of Markov complexity
