Related papers: Morse Matchings on a Hypersimplex
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the…
Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…
The existence of acyclic complete matchings on the face poset of a regular CW complex implies that the underlying topological space of the CW complex is contractible by discrete Morse theory. In this paper, we construct explicitly acyclic…
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
We characterize convex cocompact subgroups of the mapping class group of a surface in terms of uniform convergence actions on the zero locus of the limit set. We also construct subgroups that act as uniform convergence groups on their limit…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
For a genus g handlebody H a simplicial complex, with vertices being isotopy classes of certain incompressible surfaces in H, is constructed and several properties are established. In particular, this complex naturally contains, as a…
We generalize a result of Giroux which says that a closed surface in a contact $3$-manifold with Morse-Smale characteristic foliation is convex. Specifically, we show that the result holds in contact manifolds of arbitrary dimension. As an…
The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M_C of Morse-Smale functions on S^2.…
We investigate properties of the set of discrete Morse functions on a simplicial complex as defined by Forman. It is not difficult to see that the pairings of discrete Morse functions of a finite simplicial complex again form a simplicial…
Incidence relations among the cells of a regular CW complex produce a poset-enriched category of entrance paths whose classifying space is homotopy-equivalent to that complex. We show here that each acyclic partial matching (in the sense of…
The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes…
Monodromy groups, i.e. the groups of isometries of the intersection lattice L_X:=H_2/torsion generated by the monodromy action of all deformation families of a given surface, have been computed in math.AG/0006231 for any minimal elliptic…
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…
We present a complete classification of Hausdorff locally compact polycyclic monoids up to a topological isomorphism. A {\em polycyclic monoid} is an inverse monoid with zero, generated by a subset $\Lambda$ such that $xx^{-1}=1$ for any…
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
We construct, for each convex polytope, possibly nonrational and nonsimple, a family of compact spaces that are stratified by quasifolds, i.e. each of these spaces is a collection of quasifolds glued together in an suitable way. A quasifold…