Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe asymptotic volume of the Birkhoff polytope
207
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let m,n be positive integers. Define T(m,n) to be the transportation polytope consisting of the m x n non-negative real matrices whose rows each sum to 1 and whose columns each sum to m/n. The special case B(n)=T(n,n) is the much-studied Birkhoff-von Neumann polytope of doubly-stochastic matrices. Using a recent asymptotic enumeration of non-negative integer matrices (Canfield and McKay, 2007), we determine the asymptotic volume of T(m,n) as n goes to infinity, with m=m(n) such that m/n neither decreases nor increases too quickly. In particular, we give an asymptotic formula for the volume of B(n).
rate research
Read More
The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very well studied, there is not much known about the facets of the secondary polytope. The splits of a polytope, subdivisions with exactly two maximal faces, are the simplest examples of such facets and the first that were systematically investigated. The present paper can be seen as a continuation of these studies and as a starting point of an examination of the subdivisions corresponding to the facets of the secondary polytope in general. As a special case, the notion of k-split is introduced as a possibility to classify polytopes in accordance to the complexity of the facets of their secondary polytopes. An application to matroid subdivisions of hypersimplices and tropical geometry is given.
This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $ntimes ntimes n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e., the Upper and Lower Bound Theorems), we present some new lower and upper bounds. We show that the new upper bound is tighter than the one recently obtained by Chang, Paksoy and Zhang [Ann. Funct. Anal. 7 (2016), no.~3, 386--393] and also sharper than the one in Linial and Lurias [Discrete Comput. Geom. 51 (2014), no.~1, 161--170]. We demonstrate that the analog of the lower bound obtained in such a way, however, is no better than the existing ones.
We prove the unimodality of the Ehrhart $delta$-polynomial of the chain polytope of the zig-zag poset, which was conjectured by Kirillov. First, based on a result due to Stanley, we show that this polynomial coincides with the $W$-polynomial for the zig-zag poset with some natural labeling. Then, its unimodality immediately follows from a result of Gasharov, which states that the $W$-polynomials of naturally labeled graded posets of rank $1$ or $2$ are unimodal.
Regular semisimple Hessenberg varieties are subvarieties of the flag variety $mathrm{Flag}(mathbb{C}^n)$ arising naturally in the intersection of geometry, representation theory, and combinatorics. Recent results of Abe-Horiguchi-Masuda-Murai-Sato and Abe-DeDieu-Galetto-Harada relate the volume polynomials of regular semisimple Hessenberg varieties to the volume polynomial of the Gelfand-Zetlin polytope $mathrm{GZ}(lambda)$ for $lambda=(lambda_1,lambda_2,ldots,lambda_n)$. The main results of this manuscript use and generalize tools developed by Anderson-Tymoczko, Kiritchenko-Smirnov-Timorin, and Postnikov, in order to derive an explicit formula for the volume polynomials of regular semisimple Hessenberg varieties in terms of the volumes of certain faces of the Gelfand-Zetlin polytope, and also exhibit a manifestly positive, combinatorial formula for their coefficients with respect to the basis of monomials in the $alpha_i := lambda_i-lambda_{i+1}$. In addition, motivated by these considerations, we carefully analyze the special case of the permutohedral variety, which is also known as the toric variety associated to Weyl chambers. In this case, we obtain an explicit decomposition of the permutohedron (the moment map image of the permutohedral variety) into combinatorial $(n-1)$-cubes, and also give a geometric interpretation of this decomposition by expressing the cohomology class of the permutohedral variety in $mathrm{Flag}(mathbb{C}^n)$ as a sum of the cohomology classes of a certain set of Richardson varieties.
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for integer polytopes in terms of the length of the description of the polytope (in bits) and the minimum angle between facets of its polar. The second is a smoothed analysis bound: given an appropriately normalized polytope, we add small Gaussian noise to each constraint. We consider a natural geometric measure on the vertices of the perturbed polytope (corresponding to the mean curvature measure of its polar) and show that with high probability there exists a giant component of vertices, with measure $1-o(1)$ and polynomial diameter. Both bounds rely on spectral gaps -- of a certain Schrodinger operator in the first case, and a certain continuous time Markov chain in the second -- which arise from the log-concavity of the volume of a simple polytope in terms of its slack variables.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
