Related papers: Split-facets for Balanced Minimal Evolution Polyto…
We present a dynamical systems approach for geometric matchings in an ensemble of polytopes along rigid-body motions. Each polytope can be characterized by a vertex set and edge or faces determined by vertices, and polygons and simplexes…
Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…
Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial result ensures that such trees can be uniquely reconstructed…
The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…
Face alignment consists of aligning a shape model on a face image. It is an active domain in computer vision as it is a preprocessing for a number of face analysis and synthesis applications. Current state-of-the-art methods already perform…
Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
We consider the polytope arising from a marked surface by flips of triangulations. Sleator, Tarjan and Thurston studied in 1988 the diameter of the associahedron, which is the polytope arising from a marked disc by flips of triangulations.…
Phylogenetic networks are generalizations of trees that allow for the modeling of non-tree like evolutionary processes. Split networks give a useful way to construct networks with intuitive distance structures induced from the associated…
The Hofstadter butterfly (HB) and mobility edges (MEs) are hallmark phenomena of quasiperiodic systems, yet their interplay remains elusive. Here, we demonstrate their coexistence within a tilt-induced quasiperiodic potential on a square…
As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the…
The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of…
Bergman complexes are polyhedral complexes associated to matroids. Faces of these complexes are certain matroids, called matroid types, too. In order to understand the structure of these faces we decompose matroid types into direct…
We prove that, apart from some well-known low-dimensional examples, any compact hyperbolic Coxeter polytope has a pair of disjoint facets. This is one of very few known general results concerning combinatorics of compact hyperbolic Coxeter…
The equilibrium crystal shape of a body-centered solid-on-solid (BCSOS) model on a honeycomb lattice is studied numerically. We focus on the facet ridge endpoints (FRE). These points are equivalent to one dimensional KPZ-type growth in the…
This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic…
Base polytopes of polymatroids, also known as generalized permutohedra, are polytopes whose edges are parallel to a vector of the form $\mathbf{e}_i - \mathbf{e}_j$. We consider the following computational problem: Given two vertices of a…
The maximal chain polytope $\mathscr{M}(P)$ is associated with a finite poset $P$. For a set of maximal chains $\mathcal{C}$, it is shown that the convex hull of all the points corresponding to elements of $\mathcal{C}$ is not a face of…
Many problems of quantum information theory rely on the set of quantum marginals. A precise knowledge of the faces of this convex set is necessary, for example, in the reconstruction of states from their marginals or in the evaluation of…
We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this…