Koyama, Takayuki Creator Faculty akimichi.takemura@gmail.com Ogawa, Mitsunori Creator Takemura, Akimichi Creator MATH / Applied Mathematics Illinois Institute of Technology Affiliated department Algebraic Statistics Markov basis Transportation polytopes 2015 2015-11-09 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. Article

born digital application/pdf en https://doi.org/10.18409/jas.v6i2.38 6.2 Open Access eng http://hdl.handle.net/10560/islandora:1007808