Related papers: Higher Secondary Polytopes for Two-Dimensional Zon…
A famous construction of Gelfand, Kapranov and Zelevinsky associates to each finite point configuration $A \subset \mathbb{R}^d$ a polyhedral fan, which stratifies the space of weight vectors by the combinatorial types of regular…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…
Let Y be a hypersurface in projective space having only ordinary double points as singularities. We prove a variant of a conjecture of L. Wotzlaw on an algebraic description of the graded quotients of the Hodge filtration on the top…
We compute the canonical form of the cosmological polytope for any graph in terms of the dual of the shifted cosmological polytope in two different ways. On the way, we provide an explicit coordinate description of the dual of the…
There is a great number of higher-spin gravities in $3d$ that can have both finite and infinite spectra of fields and can be formulated as Chern-Simons theories. It was believed that this is impossible in higher dimensions, where…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…
We examine how generalised geometries can be associated with a labelled Dynkin diagram built around a gravity line. We present a series of new generalised geometries based on the groups $\mathit{Spin}(d,d)\times\mathbb{R}^+$ for which the…
Nestohedra are a family of convex polytopes that includes permutohedra, associahedra, and graph associahedra. In this paper, we study an extension of such polytopes, called extended nestohedra. We show that these objects are indeed the…
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…
This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
In the early 1990s, Kapranov and Voevodsky proposed a geometric method for constructing higher-categorical pasting diagrams from generically framed convex polytopes. This work revisits their construction and identifies a convex-geometric…
Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…
The results from the article [Strachan I.A.B., Szablikowski B.M., Stud. Appl. Math. 133 (2014), 84-117] are extended over consideration of central extensions allowing the introducing of additional independent variables. Algebraic conditions…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
Higher-dimensional Dedekind sums are defined as a generalization of a recent 1-dimensional probability model of Dilcher and Girstmair to a d-dimensional cube. The analysis of the frequency distribution of marked lattice points leads to new…
We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…