scientific article; zbMATH DE number 848091
From MaRDI portal
Publication:4867143
zbMath0839.52007MaRDI QIDQ4867143
A. Sarangarajan, Billera, Louis J.
Publication date: 19 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Partitions of sets (05A18) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items
Permutation polytopes corresponding to strongly supermodular functions, Matching polytopes, toric geometry, and the totally non-negative Grassmannian., On permutation polytopes, Tighter bounds on the independence number of the Birkhoff graph, Permutation polytopes and indecomposable elements in permutation groups, The c--2d-index of oriented matroids, All 0-1 polytopes are traveling salesman polytopes, Projections and angle sums of belt polytopes and permutohedra, Cumulants, spreadability and the Campbell-Baker-Hausdorff series, Bipartite perfect matching as a real polynomial, Tropical positivity and determinantal varieties, Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022, Subdivisions of generalized permutahedra, An effective solution to convex 1-body \(N\)-representability, A combinatorial proof of the cyclic sieving phenomenon for faces of coxeterhedra, The Ehrhart polynomial of the Birkhoff polytope, Some facets of the polytope of even permutation matrices., Weighted derivations and the cd-index, The Möbius function of partitions with restricted block sizes, Convex polytopes and enumeration, Equivalence of permutation polytopes corresponding to strictly supermodular functions, Polydiagonal compactification of configuration spaces, Some remarks about acyclic and tridiagonal Birkhoff polytopes, The \(k\)-assignment polytope, The geometry of products of minors, Faces of Birkhoff Polytopes, The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes, \(S\)-hypersimplices, pulling triangulations, and monotone paths, On the number of faces of certain transportation polytopes, Permutatorial optimization via the permutahedron, A real polynomial for bipartite graph minimum weight perfect matchings, Permutohedra and minimal matrices, Minimal matrices and discrete tomography, On permutation polytopes: notions of equivalence
