Related papers: Kalai's flag conjecture for locally anti-blocking …

Kalai's $3^d$ conjecture states that every centrally-symmetric $d$-polytope has at least $3^d$ faces. We give short proofs for two special cases: if $P$ is unconditional (that is, invariant w.r.t. reflection in any coordinate hyperplane),…

In this note we give a short proof of Godbersen's conjecture for the class of locally anti-blocking bodies. We show that all equality cases amongst locally anti-blocking bodies are for simplices, further supporting the conjecture. The proof…

A well-known theorem of Blind and Mani says that every simple polytope is uniquely determined by its graph. Kalai gave a very short and elegant proof of this result using the concept of acyclic orientations. As it turns out, Kalai's proof…

A generalization of the mirror conjecture is proven for the manifolds of complete flags in C^n.

A conjecture of Kalai from 1994 posits that for an arbitrary $2\leq k\leq \lfloor d/2 \rfloor$, the combinatorial type of a simplicial $d$-polytope $P$ is uniquely determined by the $(k-1)$-skeleton of $P$ (given as an abstract simplicial…

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.

A lattice polytope $\mathcal{P} \subset \mathbb{R}^d$ is called a locally anti-blocking polytope if for any closed orthant $\mathbb{R}^d_{\varepsilon}$ in $\mathbb{R}^d$, $\mathcal{P} \cap \mathbb{R}^d_{\varepsilon}$ is unimodularly…

In this short note, we prove Hadwiger's conjecture for strongly monotypic polytopes.

We extend the assertion of the Generalized Lower Bound Theorem (GLBT) to general polytopes under the assumption that their low dimensional skeleton is simplicial, with partial results for the general case. We prove a quantitative version of…

Suppose that $C$ is a centrally symmetric $d$-dimensional convex polytope; in 1989 Kalai conjectured that $C$ has at least $3^d$ facets. We prove this result if there are $d$ hyperplanes with orthogonal normal vectors so that $C$ is…

A conjecture of Kalai and Eckhoff that the face vector of an arbitrary flag complex is also the face vector of some particular balanced complex is verified.

We prove an inequality for the f-vectors of anti-self-polar polytopes conjectured by Katz in 1989. The proof uses Kalai's combinatorial inequality based on a result of Whiteley. The inequality can also be obtained from the results of…

We prove the $K(n)$-local analogue of the Hahn-Wilson conjecture on fp-spectra, which states that the truncated Brown-Peterson spectra generate the category of fp-spectra as a thick subcategory. As a corollary, we deduce the original…

We propose a combinatorial approach to the following strengthening of Gal's conjecture: $\gamma(\Delta)\ge \gamma(E)$ coefficientwise, where $\Delta$ is a flag homology sphere and $E\subseteq \Delta$ an induced homology sphere of…

The Conifold Gap Conjecture asserts that the polar part of the Gromov-Witten potential of a Calabi-Yau threefold near its conifold locus has a universal expression described by the logarithm of the Barnes $G$-function. In this paper, I…

In 1989 Kalai stated the three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture, A, became known as the ``$3^d$-conjecture''. It is well-known that the three…

In quantum geometric Langlands, the Satake equivalence plays a less prominent role than in the classical theory. Gaitsgory--Lurie proposed a conjectural substitute, later termed the fundamental local equivalence. With a few exceptions, we…

We prove that the intersection homology Poincare' polynomial P(X) of an affine toric variety X is bounded below by the product P(Y)P(X/Y), where Y is the closure of any orbit in X and X/Y is a slice transverse to the orbit. This proves a…

Using an intuition from metric geometry, we prove that any flag and normal simplicial complex satisfies the non-revisiting path conjecture. As a consequence, the diameter of its facet-ridge graph is smaller than the number of vertices minus…

We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…