Related papers: Characterizing face and flag vector pairs for poly…
This article exhibits a 4-dimensional combinatorial polytope that has no antiprism, answering a question posed by Bernt Lindst\"om. As a consequence, any realization of this combinatorial polytope has a face that it cannot rest upon without…
We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…
We provide a new axiom system for flag matroids, characterize representability of uniform flag matroids, and give forbidden minor characterizations of full flag matroids that are representable over $\mathbb{F}_2$ and $\mathbb{F}_3$ along…
Let $\Delta$ be a Delzant polytope in ${\mathbb R}^n$ and ${\bf b}\in{\mathbb Z}^n$. Let $E$ denote the symplectic fibration over $S^2$ determined by the pair $(\Delta, {\bf b})$. We prove the equivalence between the fact that $(\Delta,…
We show that if a $d$-dimensional Cohen-Macaulay complex is, in a certain sense, sufficiently "close" to being balanced, then there is a $d$-dimensional balanced Cohen-Macaulay complex having the same $f$-vector. This in turn provides some…
Given linear spaces $E$ and $F$ over the real numbers or a field of characteristic zero, a simple argument is given to represent a symmetric multilinear map $u(x_1, x_2, \ldots, x_n)$ from $E^n$ to $F$ in terms of its restriction to the…
The Four Colour Theorem asserts that the vertices of every plane graph can be properly coloured with four colors. Fabrici and G\"oring conjectured the following stronger statement to also hold: the vertices of every plane graph can be…
We explore some generalizations of fullerenes F_v (simple polyhedra with v vertices and only 5- and 6-gonal faces) seen as (d-1)-dimensional simple manifolds (preferably, spherical or polytopal) with only 5- and 6-gonal 2-faces. First,…
Abstract polytopes are a combinatorial generalization of convex and skeletal polytopes. Counting how many flag orbits a polytope has under its automorphism group is a way of measuring how symmetric it is. Polytopes with one flag orbit are…
We prove the conjecture by Feigin, Fuchs and Gelfand describing the Lie algebra cohomology of formal vector fields on an $n$-dimensional space with coefficients in symmetric powers of the coadjoint representation. We also compute the…
We study unbounded 2-dimensional metric polytopes such as those arising as K\"ahler quotients of complete K\"ahler 4-manifolds with two commuting symmetries and zero scalar curvature. Under a mild closedness condition, we obtain a complete…
We determine the spectra of cubic plane graphs whose faces have sizes 3 and 6. Such graphs, "(3,6)-fullerenes", have been studied by chemists who are interested in their energy spectra. In particular we prove a conjecture of Fowler, which…
The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant…
We study polytopes associated to factorisations of prime powers. These polytopes have explicit descriptions either in terms of their vertices or as intersections of closed halfspaces associated to their facets. We give formulae for their…
A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so…
Let $f(x)=x^{12}+ax^6+b \in \mathbb{Q}[x]$ be an irreducible polynomial, $g_4(x)=x^4+ax^2+b$, $g_6(x)=x^6+ax^3+b$, and let $G_4$ and $G_6$ be the Galois group of $g_4(x)$ and $g_6(x)$, respectively. Building upon known characterizations of…
A concept of generalized regular polytope is introduced in this work. The number of its (1...n-1)-dimensional elements is not necessarily integer, though all the combinatorial and metric properties meet those of regular polytopes in a…
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding notions in finite graphs. Combinatorial optimization studies the…
In this paper, motivated by the work of Edelman and Strang, we show that for fixed integers $d\geq 2$ and $n\geq d+1$ the configuration space of all facet volume vectors of all $d$-polytopes in $\mathbb R^{d}$ with $n$ facets is a full…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…