Christian Haase, Andreas Paffenholz
The toric ideals of $3\times 3$ transportation polytopes $T$ are quadratically generated. The only exception is the Birkhoff polytope $B_3$. If $T$ is not a multiple of $B_3$, these ideals even have squarefree quadratic initial ideals. This class contains all smooth $3 \times 3$ transportation polytopes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The Groebner fan of an ideal $I\subset k[x_1,...,x_n]$, defined by Mora and Robbiano, is a complex of polyhedral cones in $R^n$. The maximal cones of the fan are in bijection with the distinct monomial initial ideals of $I$ as the term order varies. If $I$ is homogeneous the Groebner fan is complete and is the normal fan of the state polytope of $I$. In general the Groebner fan is not complete and therefore not the normal fan of a polytope. We may ask if the restricted Groebner fan, a subdivision of $R_{>=0}^n$, is regular i.e. the normal fan of a polyhedron. The main result of this paper is a…
We present a study of the transportation polytopes appearing in the product rule of elementary multi-symmetric functions introduced by F. Vaccarino.
We describe a perturbation method that can be used to reduce the problem of finding the multivariate generating function (MGF) of a non-simple polytope to computing the MGF of simple polytopes. We then construct a perturbation that works for any transportation polytope. We apply this perturbation to the family of central transportation polytopes of order kn x n, and obtain formulas for the MGFs of the feasible cone of each vertex of the polytope and the MGF of the polytope. The formulas we obtain are enumerated by combinatorial objects. A special case of the formulas recovers the results on Bi…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of non-negative real numbers satisfying certain summation conditions. Transportation problems are, in many ways, the simplest kind of linear programs and thus have a rich combinatorial structure. First, we give new results on the diameters of certain classes of transportation polytopes and their relation to the Hirsch Conjecture, which asserts that the diamete…
Brightwell, van den Heuvel and Stougie proved that the diameter of an $m \times n$ transportation polytope is at most $8(m+n-2)$, a factor of eight away from the Hirsch Conjecture. This bound was improved to $3(m+n-1)$ by Hurkens. We investigate diameters for certain classes of transportation polytopes. Note: After the completion of this note, we discovered that the class of transportation polytopes studied in this note was already considered in Michel L. Balinski. On two special classes of transportation polytopes. Math. Programming Stud., 1:43-58, 1974. Michel L. Balinski and Fred J. Rispoli…
This paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, in particular, their possible numbers of vertices and their diameters. Our main results include a quadratic bound on the diameter of axial 3-way transportation polytopes and a catalogue of non-degenerate transportation polytopes of small sizes. The catalogue disproves five conjectures about these polyhedra stated in the monograph by Yemelichev et al. (1984). It also allowed us to discover some new results. For example, we prove that the number of vertices of an $m\times n$ transportation polytope is a mu…
We expand on a result of Barvinok and Hartigan to derive asymptotic formulas for the number of integer and binary integer points in a wide class of multi-index $k_1\times k_2\times \ldots \times k_ν$ transportation polytopes. A simple closed form approximation is given as the $k_j$s go to infinity.
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch conjecture is true for general $m{\times}n$--transportation polytopes. In earlier work the first three authors introduced a hierarchy of variations to the notion of graph diameter in polyhedra. The key reason was that this hierarchy provides some interesting lower bounds for the usual graph diameter. This paper has three contributions: First, we compare the hierarc…
This paper deals with transportation polytopes in the probability simplex (that is, sets of categorical bivariate probability distributions with prescribed marginals). Information projections between such polytopes are studied, and a sufficient condition is described under which these mappings are homeomorphisms.
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have interest for discrete mathematics because permutation matrices, latin squares, and magic squares appear naturally as lattice points of these polytopes. In this paper we survey advances on the understanding of the combinatorics and geometry of these polyhedra and include some recent unpublished results on the diameter of graphs of these polytopes. In particular, t…
Extreme points of general transportation polytopes
本文研究了一类行和与列和分别受限于上下界向量的更一般的非负运输矩阵，证明了该集合构成凸多胞体，并完整刻画了其极值点。
Let ${\mathcal D}^{k,l}(m,n)$ be the set of all the integer points in the transportation polytope of $kn\times ln$ matrices with row sums $lm$ and column sums $km$. In this paper we find the sharp lower bound on the tropical determinant over the set ${\mathcal D}^{k,l}(m,n)$. This integer piecewise-linear programming problem in arbitrary dimension turns out to be equivalent to an integer non-linear (in fact, quadratic) optimization problem in dimension two. We also compute the sharp upper bound on a modification of the tropical determinant, where the maximum over all the transversals in a matr…
We give a simple construction of an orthogonal basis for the space of m by n matrices with row and column sums equal to zero. This vector space corresponds to the affine space naturally associated with the Birkhoff polytope, contingency tables and Latin squares. We also provide orthogonal bases for the spaces underlying magic squares and Sudoku boards. Our construction combines the outer (i.e., tensor or dyadic) product on vectors with certain rooted, vector-labeled, binary trees. Our bases naturally respect the decomposition of a vector space into centrosymmetric and skew-centrosymmetric piec…
A parallel server system is a stochastic processing network with applications in manufacturing, supply chain, ride-hailing, call centers, etc. Heterogeneous customers arrive in the system, and only a subset of servers can serve any customer type given by the flexibility graph. The goal of the system operator is to minimize the delay that depends on the scheduling policy and the flexibility graph. A long line of literature focuses on designing near-optimal scheduling policies given a flexibility graph. On the contrary, we fix the scheduling policy to be the so-called MaxWeight scheduling given …
We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate the volume of the polytope of mxn non-negative real matrices with prescribed row and column sums. Our estimates are solutions of convex optimization problems and hence can be computed efficiently. As a corollary, we show that if row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n) with r_1 + ... + r_m =c_1 + ... +c_n =N are sufficiently far from cons…
We give a combinatorial description of the toric ideal of invariants of the Cavender-Farris-Neyman model with a molecular clock (CFN-MC) on a rooted binary phylogenetic tree and prove results about the polytope associated to this toric ideal. Key results about the polyhedral structure include that the number of vertices of this polytope is a Fibonacci number, the facets of the polytope can be described using the combinatorial "cluster" structure of the underlying rooted tree, and the volume is equal to an Euler zig-zag number. The toric ideal of invariants of the CFN-MC model has a quadratic G…
Optimal Transport on Graphs and Stochastically Evolving Trees
该研究针对图上概率密度函数的最优传输问题，通过分析关联多面体提出最速下降算法，可高效计算1-Wasserstein距离，并将其应用于图的Ollivier-Ricci曲率计算。
A referee found an error in the proof of the Main Theorem ("toric ideals of flow polytopes are generated in degree 3") that we could not fix. More precisely, the proof of Lemma 4.2.(ii) is incorrect. The results on Gröbner bases are untouched by this. ----- We show that toric ideals of flow polytopes are generated in degree 3. This was conjectured by Diaconis and Eriksson for the special case of the Birkhoff polytope. Our proof uses a hyperplane subdivision method developed by Haase and Paffenholz. It is known that reduced revlex Gröbner bases of the toric ideal of the Birkhoff polytope $B_n$ …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。