| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656325 | Journal of Combinatorial Theory, Series A | 2007 | 11 Pages |
Abstract
We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is greater than a computable bound, the Markov bases consist of elements from Markov bases of smaller tables. We give an explicit formula for this bound in terms of Graver bases. We also compute these Markov and Graver complexities for all K×2×2×2 tables.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
