Gelfand―Tsetlin Polytopes and Feigin―Fourier―Littelmann―Vinberg Polytopes as Marked Poset Polytopes by Federico Ardila, Thomas Bliem, Dido Salazar

Subjects: Get full text

Lectures on polytopes / by 445289 Ziegler, Gunter M

Subjects: “…Polytopes…”

Regular polytopes/ by Coxeter, H. S. M. (Harold Scott Macdonald), 1907-

Subjects: “…Polytopes…”

Regular polytopes / by Coxeter, H. S. M. (Harold Scott Macdonald), 1907-

Subjects: “…Polytopes…”

Regular complex polytopes / by Coxeter, H. S. M. (Harold Scott Macdonald), 1907-

Subjects: “…Polytopes…”

Polytopes, graphs and optimisation / by Yemelichev, V. A. (Vladimir Alekseevich), Kovalev, Mikhail Mikhailovich, Kravtsov, M. K. (Mikhail Konstantinovich), Lawden, G. H.

Subjects: “…Polytopes…”

The diameter of the Birkhoff polytope by Bouthat Ludovick, Mashreghi Javad, Morneau-Guérin Frédéric

Subjects: Get full text

Triangulations of cyclic polytopes by Steffen Oppermann, Hugh Thomas

Subjects: Get full text

Perturbation of transportation polytopes by Fu Liu

Subjects: Get full text

Cayley and Tutte polytopes by Matjaž Konvalinka, Igor Pak

Subjects: “…polytopes…”
Get full text

Matroid Polytopes and Their Volumes by Federico Ardila, Carolina Benedetti, Jeffrey Doker

Subjects: Get full text

Omnidimensional Convex Polytopes by Szymon Łukaszyk, Andrzej Tomski

Subjects: “…regular basic convex polytopes…”
Get full text

Bruhat interval polytopes by Emmanuel Tsukerman, Lauren Williams

“…In this paper we study combinatorial aspects of Bruhat interval polytopes. For example, we give an inequality description and a dimension formula for Bruhat interval polytopes, and prove that every face of a Bruhat interval polytope is a Bruhat interval polytope. …”
Get full text

polymake and Lattice Polytopes by Michael Joswig, Benjamin Müller, Andreas Paffenholz

Subjects: Get full text

Random Inscribing Polytopes by Ross M. Richardson, Van H. Vu, Lei Wu

Subjects: “…random polytope…”
Get full text

The polytope of Tesler matrices by Karola Mészáros, Alejandro H. Morales, Brendon Rhoades

Subjects: Get full text

On the skeleton of the metric polytope by Deza, Antoine., Fukuda, Komei., Pasechnik, Dmitrii V., Sato, Masanori.

“…We consider convex polyhedra with applications to well-known combinatorial optimization problems: the metric polytope m n and its relatives. For n ≤ 6 the description of the metric polytope is easy as m n has at most 544 vertices partitioned into 3 orbits; m 7 - the largest previously known instance - has 275 840 vertices but only 13 orbits. …”
Get full text
Get full text

On moments of a polytope by Gravin, N, Pasechnik, D, Shapiro, B, Shapiro, M

“…Using this, we solve the inverse moment problem for the set of, not necessarily convex, polytopes having a given set S of vertices. Under a weak non-degeneracy assumption we also show that the uniform measure supported on any such polytope is a linear combination of uniform measures supported on simplices with vertices in S.…”

Decomposition of polytopes and polynomials by Gao, S, Lauder, A

“…Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. …”

On moments of a polytope by Gravin, N, Pasechnik, D, Shapiro, B, Shapiro, M

“…Using this, we solve the inverse moment problem for the set of, not necessarily convex, polytopes having a given set S of vertices. Under a weak non-degeneracy assumption we also show that the uniform measure supported on any such polytope is a linear combination of uniform measures supported on simplices with vertices in S.…”