相关论文: Freehedra are short
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
In this short paper we review and extract some features of the Fredholm Alternative problem .
In hep-th/0111053, a complete simplicial fan was associated to an arbitrary finite root system. It was conjectured that this fan is the normal fan of a simple convex polytope (a generalized associahedron of the corresponding type). Here we…
In this short note we consider generalized associahedra of type D_n. We prove that these simple flag polytopes are not nestohedra for n > 3, but the statement of Gal's conjecture holds for them.
Recent progress on flow polytopes indicates many interesting families with product formulas for their volume. These product formulas are all proved using analytic techniques. Our work breaks from this pattern. We define a family of closely…
The tree-level scattering amplitudes for $\text{tr}(\phi^3)$ theory can be interpreted as a sum over the vertices of a polytope known as the associahedron. For each graph $G$, there exists a natural generalisation of the associahedron,…
We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
The paper is devoted to explaining the operadic meaning of freehedra, a family of polytopes originally defined to study free loop spaces. We introduce the notion of operadic pairs and algebras over them. Cellular chains on Stasheff…
Differentially algebraic Hardy field extensions of short Hardy fields are short. This is proved in the more general setting of $H$-fields. As an application we extend a theorem of Rosenlicht (1981) by showing that each short asymptotic…
This paper introduces a new method to solve the problem of the approximation of the diagonal for face-coherent families of polytopes. We recover the classical cases of the simplices and the cubes and we solve it for the associahedra, also…
A polytrope is a tropical polytope which at the same time is convex in the ordinary sense. A $d$-dimensional polytrope turns out to be a tropical simplex, that is, it is the tropical convex hull of $d+1$ points. This statement is equivalent…
Among integral polytopes (vertices with integral coordinates), lattice-free polytopes - intersecting the lattice ONLY at their vertices- are of particular interestin combinatorics and geometry of numbers. A natural question is to measure…
We consider families of simple polytopes $P$ and simplicial complexes $K$ well-known in polytope theory and convex geometry, and show that their moment-angle complexes have some remarkable homotopy properties which depend on combinatorics…
There are many open problems and some mysteries connected to the realizations of the associahedra as convex polytopes. In this note, we describe three -- concerning special realizations with the vertices on a sphere, the space of all…
Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…
We classify all tuples of lattice polyhedra of relative mixed volume 1 and all minimal (by inclusion) tuples of polyhedra of relative mixed volume 2. We also prove a conjecture by A. Esterov, which states that all tuples with finite…
We give a decomposition of the suspension of a polyhedral join in terms of the polyhedral smash product of the suspension of the family of pairs, and study some cases in which the formula can be desuspended, particularly for polyhedral…
An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. A particularly elegant realization of the associahedron, due to S. Shnider and S. Sternberg…
We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.