• Corpus ID: 226236761

Higher Secondary Polytopes for Two-Dimensional Zonotopes.

  title={Higher Secondary Polytopes for Two-Dimensional Zonotopes.},
  author={Elisabeth Bullock and Katie Gravel},
  journal={arXiv: Combinatorics},
Very recently, Galashin, Postnikov, and Williams introduced the notion of higher secondary polytopes, generalizing the secondary polytope of Gelfand, Kapranov, and Zelevinsky. Given an $n$-point configuration $\mathcal{A}$ in $\mathbb{R}^{d-1}$, they define a family of convex $(n-d)$-dimensional polytopes $\widehat{\Sigma}_{1}, \ldots, \widehat{\Sigma}_{n-d}$. The $1$-skeletons of this family of polytopes are the flip graphs of certain combinatorial configurations which generalize… 
52C40 Oriented matroids in discrete geometry 51M20 Polyhedra and polytopes; regular figures, division of spaces 05C10 Planar graphs; geometric and topological aspects of graph theory 05C15 Coloring of graphs and hypergraphs
  • Mathematics
  • 2021
Let π : R → R be any linear projection, let A be the image of the standard basis. Motivated by Postnikov’s study of postitive Grassmannians via plabic graphs and Galashin’s connection of plabic


Higher secondary polytopes and regular plabic graphs
Author(s): Galashin, Pavel; Postnikov, Alexander; Williams, Lauren | Abstract: Given a configuration $A$ of $n$ points in $\mathbb{R}^{d-1}$, we introduce the higher secondary polytopes
Purity and separation for oriented matroids
Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related
  • A. Postnikov
  • Mathematics
    Proceedings of the International Congress of Mathematicians (ICM 2018)
  • 2019
The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic
Rotation distance, triangulations, and hyperbolic geometry
A tight bound is established on the maximum rotation distance between two A2-node trees for all large n, using volumetric arguments in hyperbolic 3-space, and is given on the minimum number of tetrahedra needed to dissect a polyhedron in the worst case.
Computing Triangulations Using Oriented Matroids
The most important ingredients necessary to exploit oriented matroids as a data structure for computing all triangulations of a point configuration are surveyed, and experience with an implementation of these concepts in the software package TOPCOM is reported on.
Annals of Mathematics
ing from the embeddability relation between order types, define a quasi-order to be a reflexive, transitive relation. Throughout this paper, the letters Q and R will range over quasi-ordered sets and
Hypersimplicial subdivisions
<jats:p>Let <jats:inline-formula><jats:alternatives><jats:tex-math>$$\pi :{\mathbb {R}}^n \rightarrow {\mathbb {R}}^d$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
Tiling a polygon with parallelograms
Three generalizations of this problem, that of tiling by a fixed set of triangles, a fixedSet of trapezoids, or parallelogram tiling for polygonal regions with holes, are shown to be NP-complete.