English
Related papers

Related papers: Nonsimplicities and the perturbed wedge

200 papers

In a compact, symplectic real manifold, i.e supporting an antisymplectic involution, we use Donaldson's construction to build a codimension 2 symplectic submanifold invariant under the action of the involution. If the real part of the…

Symplectic Geometry · Mathematics 2007-12-06 Damien Gayet

For a polytope P a simplex S with vertex set V(S) is called a special simplex if every facet of P contains all but exactly one vertex of S. For such polytopes P with face complex F(P) containing a special simplex the subcomplex F(P) / V(S)…

Combinatorics · Mathematics 2010-10-01 Timo de Wolff

Let $X$ be a cubic fourfold in $P^5_{C}$. We prove that, assuming the Hodge conjecture for the product $S \times S$, where $S$ is a complex surface, and the finite dimensionality of the Chow motive $h(S)$, there are at most a countable…

Algebraic Geometry · Mathematics 2017-01-23 Claudio Pedrini

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…

Combinatorics · Mathematics 2014-04-14 Karim Alexander Adiprasito , Bruno Benedetti

W. M. Hirsch formulated a beautiful conjecture on diameters of convex polyhedra.I suggest a new viewpoint with the deformation and moduli of polytopes.

Combinatorics · Mathematics 2008-04-25 Yuji Odaka

The Wythoff construction takes a $d$-dimensional polytope $P$, a subset $S$ of $\{0,..., d\}$ and returns another $d$-dimensional polytope $P(S)$. If $P$ is a regular polytope, then $P(S)$ is vertex-transitive. This construction builds a…

Combinatorics · Mathematics 2008-08-11 Michel Deza , Mathieu Dutour , Sergey Shpectorov

We provide a family of $5$-dimensional prismatoids whose width grows linearly in the number of vertices. This provides a new infinite family of counter-examples to the Hirsch conjecture whose excess width grows linearly in the number of…

A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The author recently showed in arXiv:1006.2814…

Combinatorics · Mathematics 2011-04-18 Francisco Santos

We examine the five-dimensional super-de Rham complex with $N = 1$ supersymmetry. The elements of this complex are presented explicitly and related to those of the six-dimensional complex in $N = (1, 0)$ superspace through a specific notion…

High Energy Physics - Theory · Physics 2015-06-11 S. James Gates , William D. Linch , Stephen Randall

We construct the most general single-mode superstrata in 5 dimensions with ambipolar, two centered Gibbons Hawking bases, via dimensional reduction of superstrata in 6 dimensions. Previously, asymptotically $\text{AdS}_{3}\times…

High Energy Physics - Theory · Physics 2019-10-23 Robert Walker

Corsten and Frankl conjectured that a simplex is diameter-Ramsey if and only if its circumcenter lies in its convex hull. We disprove this conjecture in every dimension $d\ge 3$. The main tool is a sufficient criterion based on a…

Combinatorics · Mathematics 2026-04-22 Yaping Mao

We explore a notion of pseudofinite dimension, introduced by Hrushovski and Wagner, on an infinite ultraproduct of finite structures. Certain conditions on pseudofinite dimension are identified that guarantee simplicity or supersimplicity…

Logic · Mathematics 2014-10-01 Dario Garcia , Dugald Macpherson , Charles Steinhorn

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

Combinatorics · Mathematics 2015-01-23 Volker Kaibel , Matthias Walter

We introduce a new method for building higher-degree sum-of-squares lower bounds over the hypercube $\mathbf{x} \in \{\pm 1\}^N$ from a given degree 2 lower bound. Our method constructs pseudoexpectations that are positive semidefinite by…

Data Structures and Algorithms · Computer Science 2020-09-16 Dmitriy Kunisky

The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the…

Combinatorics · Mathematics 2013-10-29 Francisco Santos

We prove the Voronoi conjecture for five-dimensional parallelohedra. Namely, we show that if a convex five-dimensional polytope $P$ tiles $\mathbb R^5$ with translations, then $P$ is an affine image of the Dirichlet-Voronoi polytope for a…

Combinatorics · Mathematics 2025-02-11 Alexey Garber

A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The first author recently showed that the…

Combinatorics · Mathematics 2012-02-28 Francisco Santos , Tamon Stephen , Hugh Thomas

We introduce the wedge product of two polytopes. The wedge product is described in terms of inequality systems, in terms of vertex coordinates as well as purely combinatorially, from the corresponding data of its constituents. The wedge…

Metric Geometry · Mathematics 2009-08-24 Thilo Rörig , Günter M. Ziegler

We consider the convex hull of the perturbed point process comprised of $n$ i.i.d. points, each distributed as the sum of a uniform point on the unit sphere $\S^{d-1}$ and a uniform point in the $d$-dimensional ball centered at the origin…

Probability · Mathematics 2019-12-24 Pierre Calka , J. E. Yukich

We construct an explicit normal singular affine toric variety X of dimension five over an algebraically closed field of characteristic three such that the normalized Nash blowup of X already contains an open affine subset isomorphic to X.…

Algebraic Geometry · Mathematics 2026-04-10 Alvaro Liendo , Ana Julisa Palomino , Gonzalo Rodríguez