English
Related papers

Related papers: How many $n$-vertex triangulations does the $3$-sp…

200 papers

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

Combinatorics · Mathematics 2010-10-12 George B. Purdy , Justin W. Smith

Triangulations of the cube into a minimal number of simplices without additional vertices have been studied by several authors over the past decades. For $3\leq n\leq 7$ this so-called simplexity of the unit cube $I^n$ is now known to be…

Combinatorics · Mathematics 2012-09-19 Jan Brandts , Sander Dijkhuis , Vincent de Haan , Michal Křížek

We find the first non-octahedral balanced 2-neighborly 3-sphere and the balanced 2-neighborly triangulation of the lens space $L(3,1)$. Each construction has 16 vertices. We show that there exists a balanced 3-neighborly non-spherical…

Combinatorics · Mathematics 2020-04-21 Hailun Zheng

We study the double homology associated to triangulated spheres and present two results. First, we explicitly compute the double homology for minimum degree sphere triangulations. Using a spectral sequence argument, we compute the effect of…

Algebraic Topology · Mathematics 2024-07-02 Carlos Gabriel Valenzuela Ruiz

In 1995, Josckusch constructed an infinite family of centrally symmetric (cs, for short) triangulations of $3$-spheres that are cs-$2$-neighborly. Recently, Novik and Zheng extended Jockusch's construction: for all $d$ and $n>d$, they…

Combinatorics · Mathematics 2022-01-11 Isabella Novik , Hailun Zheng

We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.

Combinatorics · Mathematics 2011-11-10 Maxim Krikun

Any four mutually tangent spheres in R^3 determine three coincident lines through opposite pairs of tangencies. As a consequence, we define two new triangle centers.

Metric Geometry · Mathematics 2010-01-21 David Eppstein

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

Combinatorics · Mathematics 2016-04-07 Micha Sharir , Noam Solomon

A triangulation of a $3$-manifold can be shown to be homeomorphic to the $3$-sphere by describing a discrete Morse function on it with only two critical faces, that is, a sequence of elementary collapses from the triangulation with one…

Geometric Topology · Mathematics 2019-10-24 João Paixão , Jonathan Spreer

We prove that triangulations of homology spheres in any dimension grow much slower than general triangulations. Our bound states in particular that the number of triangulations of homology spheres in 3 dimensions grows at most like the…

Mathematical Physics · Physics 2015-06-15 Vincent Rivasseau

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

Combinatorics · Mathematics 2023-06-06 Yixi Liao , Erxiao Wang

For each $d\geq 3$ we construct cube complexes homeomorphic to the $d$-sphere with $n$ vertices in which the number of facets (assuming $d$ constant) is $\Omega(n^{5/4})$. This disproves a conjecture of Kalai's stating that the number of…

Combinatorics · Mathematics 2025-03-25 Sergey Avvakumov , Alfredo Hubard

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

Discrete Mathematics · Computer Science 2010-01-03 Micha Sharir , Adam Sheffer

We show that the number of partial triangulations of a set of $n$ points on the plane is at least the $(n-2)$-nd Catalan number. This is tight for convex $n$-gons. We also describe all the equality cases.

Combinatorics · Mathematics 2021-04-14 Andrey Kupavskii , Aleksei Volostnov , Yury Yarovikov

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Combinatorics · Mathematics 2024-04-24 Arnau Padrol , Eva Philippe , Francisco Santos

We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum…

Combinatorics · Mathematics 2016-07-21 Hailun Zheng

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

History and Overview · Mathematics 2019-10-09 Richard K. Guy

We introduce a new approach and prove that the maximum number of triangles in a $C_5$-free graph on $n$ vertices is at most $$(1 + o(1)) \frac{1}{3 \sqrt 2} n^{3/2}.$$ We also show a connection to $r$-uniform hypergraphs without (Berge)…

Combinatorics · Mathematics 2018-11-30 Beka Ergemlidze , Abhishek Methuku

There are exactly eight edge-to-edge tilings of the sphere by congruent equilateral pentagons: three pentagonal subdivision tilings with 12, 24, 60 tiles; four earth map tilings with 16, 20, 24, 24 tiles; and one flip modification of the…

Combinatorics · Mathematics 2021-06-29 Yohji Akama , Erxiao Wang , Min Yan

A small triangulation of the sphere product can be found in lower dimensions by computer search and is known in few other cases: Klee and Novik constructed a centrally symmetric triangulation of $\mathbb{S}^i\times \mathbb{S}^{d-i-1}$ with…

Combinatorics · Mathematics 2019-10-18 Alexander Wang , Hailun Zheng