dmtcs:3097 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2012,
DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
-
https://doi.org/10.46298/dmtcs.3097
Perturbation of transportation polytopesArticle
Authors: Fu Liu 1
NULL
Fu Liu
1 Department of Mathematics [Univ California Davis]
We describe a perturbation method that can be used to compute the multivariate generating function (MGF) of a non-simple polyhedron, and then construct a perturbation that works for any transportation polytope. Applying this perturbation to the family of central transportation polytopes of order $kn \times n$, we obtain formulas for the MGF of the polytope. The formulas we obtain are enumerated by combinatorial objects. A special case of the formulas recovers the results on Birkhoff polytopes given by the author and De Loera and Yoshida. We also recover the formula for the number of maximum vertices of transportation polytopes of order $kn \times n$.
Rafael Cação;Lucas Cortez;Ismael de Farias;Ernee Kozyreff;Jalil Khatibi Moqadam;et al., 2021, Quantum Walk on the Generalized Birkhoff Polytope Graph, Entropy, 23, 10, pp. 1239, 10.3390/e23101239, https://doi.org/10.3390/e23101239.