Four questions on Birkhoff polytopes
From MaRDI portal
Publication:1977733
DOI10.1007/PL00001277zbMath0974.52010OpenAlexW2126244582WikidataQ56003270 ScholiaQ56003270MaRDI QIDQ1977733
Publication date: 9 December 2001
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00001277
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
A practical volume algorithm, On permutation polytopes, Algebraic and geometric structures inside the Birkhoff polytope, Tighter bounds on the independence number of the Birkhoff graph, Permutation polytopes and indecomposable elements in permutation groups, Erdős-Ko-Rado for perfect matchings, Monotone diameter of bisubmodular polyhedra, Ehrhart positivity of Tesler polytopes and Berline-Vergne's valuation, Lower bounds for contingency tables via Lorentzian polynomials, Phase transition in random contingency tables with non-uniform margins, The diameters of network-flow polytopes satisfy the Hirsch conjecture, Random walks on the vertices of transportation polytopes with constant number of sources, A Note on Helson’s Conjecture on Moments of Random Multiplicative Functions, Gelfand-Tsetlin polytopes and the integer decomposition property, Volume of the space of qubit-qubit channels and state transformations under random quantum channels, Faces of Birkhoff Polytopes, THE BOUNDARY VOLUME OF A LATTICE POLYTOPE, On the number of faces of certain transportation polytopes, On the Length of Monotone Paths in Polyhedra, Stochastic n-point D-bifurcations of stochastic Lévy flows and their complexity on finite spaces
