由构形纤维定义的构形的马尔可夫度
Markov degree of configurations defined by fibers of a configuration
摘要：
我们考虑一系列的配置定义的纤维的一个给定的基本配置。我们证明了配置的马尔可夫度是由基配置的马尔可夫复杂性从上有界的。作为基构形的重要例子，我们考虑了图的关联矩阵，并研究了由关联矩阵的纤维定义的构形的最大马尔可夫度。特别地，我们证明了双向运输多面体的马尔可夫度是三。
英文摘要：
We consider a series of configurations defined by fibers of a given base configuration. We prove that Markov degree of the configurations is bounded from above by the Markov complexity of the base configuration. As important examples of base configurations we consider incidence matrices of graphs and study the maximum Markov degree of configurations defined by fibers of the incidence matrices. In particular we give a proof that the Markov degree for two-way transportation polytopes is three.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
