Pages that link to "Item:Q868884"
From MaRDI portal
The following pages link to A finiteness theorem for Markov bases of hierarchical models (Q868884):
Displayed 34 items.
- Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
- Markov complexity of monomial curves (Q404574) (← links)
- Dyck path triangulations and extendability (Q482245) (← links)
- Unimodular binary hierarchical models (Q505913) (← links)
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- Finite Gröbner bases in infinite dimensional polynomial rings and applications (Q655333) (← links)
- Generalized robust toric ideals (Q886980) (← links)
- Markov bases and generalized Lawrence liftings (Q891951) (← links)
- \(N\)-fold integer programming (Q951095) (← links)
- Markov bases of binary graph models of \(K_{4}\)-minor free graphs (Q986112) (← links)
- On the Gröbner complexity of matrices (Q1017673) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Bouquet algebra of toric ideals (Q1655816) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- On the strongly robust property of toric ideals (Q2099277) (← links)
- Multigraded commutative algebra of graph decompositions (Q2248919) (← links)
- Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) (Q2301979) (← links)
- A Kruskal-Katona type result and applications (Q2305915) (← links)
- Huge multiway table problems (Q2339833) (← links)
- Markov chain Monte Carlo test of toric homogeneous Markov chains (Q2360891) (← links)
- Minimal generating sets of lattice ideals (Q2404863) (← links)
- Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
- The Markov complexity of book graphs (Q2682849) (← links)
- COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS (Q2854971) (← links)
- A survey of discrete methods in (algebraic) statistics for networks (Q2979659) (← links)
- Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- Universal Gröbner Bases of Colored Partition Identities (Q4908505) (← links)
- Normal Binary Hierarchical Models (Q5281709) (← links)
- Exact Goodness‐of‐Fit Testing for the Ising Model (Q5738828) (← links)
- (Q5874501) (← links)
- Theorems of Carathéodory, Minkowski–Weyl, and Gordan up to Symmetry (Q6043381) (← links)
- Asymptotic behavior of Markov complexity (Q6199053) (← links)