English
Related papers

Related papers: An Euler characteristic proof that 4-prismatoids h…

200 papers

Santos' construction of counter-examples to the Hirsch Conjecture (2012) is based on the existence of prismatoids of dimension d of width greater than d. Santos, Stephen and Thomas (2012) have shown that this cannot occur in $d \le 4$.…

Combinatorics · Mathematics 2015-09-22 Benjamin Matschke , Francisco Santos , Christophe Weibel

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

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 topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…

Combinatorics · Mathematics 2022-08-05 Francisco Criado , Francisco Santos

In this paper, we give an example of a chiral 4-polytope in projective 3-space. This example naturally yields a finite chiral 4-polytope in Euclidean 4-space, giving a counterexample to Theorem 11.2 of [2].

Combinatorics · Mathematics 2013-11-08 Javier Bracho , Isabel Hubard , Daniel Pellicer

The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…

Combinatorics · Mathematics 2013-04-30 Francisco Santos

We show that extended graph 4-manifolds with positive Euler characteristic cannot support a complex structure. This result stems from a new proof of the fact that a closed real-hyperbolic 4-manifold cannot support a complex structure.…

Differential Geometry · Mathematics 2024-04-22 Michael Albanese , Luca F. Di Cerbo

Erd\H{o}s asked whether every $n$-point set in Euclidean space whose $\binom{n}{2}$ pairwise distances are mutually at least $1$ apart must have diameter at least $(1+o(1))n^2$. We disprove this statement by constructing for every prime…

Combinatorics · Mathematics 2026-04-17 Boon Suan Ho

From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets $f$ and dimension $d$. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper…

Combinatorics · Mathematics 2018-04-19 Steffen Borgwardt , Tamon Stephen , Timothy Yusun

We prove that for n>4 there is no compact arithmetic hyperbolic n-manifold whose Euler characteristic has absolute value equal to 2. In particular, this shows the nonexistence of arithmetically defined hyperbolic rational homology n-sphere…

Geometric Topology · Mathematics 2014-10-01 Vincent Emery

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

The Hirsch Conjecture stated that any $d$-dimensional polytope with n facets has a diameter at most equal to $n - d$. This conjecture was disproved by Santos (A counterexample to the Hirsch Conjecture, Annals of Mathematics, 172(1) 383-412,…

Optimization and Control · Mathematics 2025-04-22 Yaguang Yang

It is shown that there are infinitely many compact orientable smooth 4-manifolds which do not admit Einstein metrics, but nevertheless satisfy the strict Hitchin-Thorpe inequality 2 chi > 3 |tau|. The examples in question arise as…

dg-ga · Mathematics 2008-02-03 Claude LeBrun

This is the announcement of an alternative approach to the 3-dimensional Poincar\'e Conjecture, different from Perelman's big and spectacular breakthrough. No claim concerning the other parts of the Thurston Geometrization Conjecture, come…

Geometric Topology · Mathematics 2007-05-23 Valentin Poenaru

Santos' construction of the first known counterexample to the Hirsch conjecture, for bounded polytopes, follows the strategy of first finding a counterexample to the nonrevisiting conjecture. Santos constructs a $5$-dimensional…

Combinatorics · Mathematics 2013-11-05 Fred B. Holt

We prove that complete non-locally symmetric quaternionic K\"ahler manifolds with an end of finite volume exist in all dimensions $4m\ge 4$.

Differential Geometry · Mathematics 2022-05-30 V. Cortés

Hutchinson, Richter and Seymour [J. Combin. Theory Ser. B 84 (2002), 225-239] showed that every Eulerian triangulation of an orientable surface that has a sufficiently high representativity is 4-colorable. We give an explicit bound on the…

Combinatorics · Mathematics 2024-10-01 Marcin Brianski , Daniel Kral , Ander Lamaison , Xichao Shu

We prove the following comparison theorem for metrics with nonnegative scalar curvature, also known as the dihedral rigidity conjecture by Gromov: for $n\le 7$, if an $n$-dimensional prism has nonnegative scalar curvature and weakly mean…

Differential Geometry · Mathematics 2022-09-05 Chao Li

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

Combinatorics · Mathematics 2026-02-24 Peter Frankl , Hongliang Lu , Jie Ma , Yuze Wu
‹ Prev 1 2 3 10 Next ›