English
Related papers

Related papers: On vertex-minimal simplicial maps to the sphere

200 papers

Let $K$ be a field with ${\rm char}(K)=0$. For a partition $\lambda$ of $n \in {\mathbb N}$, let $I^{\rm Sp}_\lambda$ be the ideal of $R=K[x_1,\ldots,x_n]$ generated by all Specht polynomials of shape $\lambda$. These ideals have been…

Commutative Algebra · Mathematics 2023-05-16 Kosuke Shibata , Kohji Yanagawa

A map $f: K \to \mathbb{R}^d$ of a simplicial complex is an almost embedding if $f(\sigma) \cap f(\tau) = \varnothing$ whenever $\sigma, \tau$ are disjoint simplices of $K$. Fix integers $d,k \geqslant 2$ such that $k+2 \leqslant d…

Geometric Topology · Mathematics 2022-06-28 Emil Alkin

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

Combinatorics · Mathematics 2010-07-23 Benjamin Braun , Richard Ehrenborg

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

Combinatorics · Mathematics 2007-05-23 Adam Bliss , Francis Edward Su

A well known consequence of the Borsuk-Ulam theorem is that if the $d$-dimensional sphere $S^d$ is covered with less than $d+2$ open sets, then there is a set containing a pair of antipodal points. In this paper we provide lower and upper…

Combinatorics · Mathematics 2014-12-17 Imre Bárány , Ruy Fabila-Monroy , Birgit Vogtenhuber

In this paper, we determine the topology of the spaces of convex polyhedra inscribed in the unit $2$-sphere and the spaces of strictly Delaunay geodesic triangulations of the unit $2$-sphere. These spaces can be regarded as discretized…

Geometric Topology · Mathematics 2023-05-31 Yanwen Luo , Tianqi Wu , Xiaoping Zhu

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…

Computational Geometry · Computer Science 2010-09-16 Amol Aggarwal

Let \Delta be a (d-1)-dimensional homology sphere on n vertices with m minimal non-faces. We consider the invariant \alpha := m - (n-d) and prove that for a given value of \alpha, there are only finitely many homology spheres that cannot be…

Combinatorics · Mathematics 2012-08-07 Lukas Katthän

In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup's generalised lower…

Geometric Topology · Mathematics 2012-01-31 Bhaskar Bagchi , Basudeb Datta

This article presents an improvement and extension of the heuristic first presented by Hougardy, Lutz, and Zelke in 2010 for realizing triangulated orientable surfaces with few vertices by a simplex-wise linear embedding. The improvement…

Metric Geometry · Mathematics 2016-03-17 Ulrich Brehm , Undine Leopold

A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each line is equal to $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$. In the present…

Combinatorics · Mathematics 2025-12-01 Vladimir N. Potapov , Anna A. Taranenko

We show two sphere theorems for the Riemannian manifolds with scalar curvature bounded below and the non-collapsed $\mathrm{RCD}(n-1,n)$ spaces with mean distance close to $\frac{\pi}{2}$.

Differential Geometry · Mathematics 2022-06-06 Jialong Deng

It is known that the $(2k-1)$-sphere has at most $2^{O(n^k \log n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k\ge 2$. Here we construct at least $2^{\Omega(n^k)}$ such triangulations, improving on the previous…

Combinatorics · Mathematics 2016-03-10 Eran Nevo , Francisco Santos , Stedman Wilson

In 1967, Gr\"unmbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. This conjecture along with the…

Combinatorics · Mathematics 2022-07-29 Lei Xue

A \emph{stacked triangulation} of a $d$-simplex $\mathbf{o}=\{1,\ldots,d+1\}$ ($d\geq 2$) is a triangulation obtained by repeatedly subdividing a $d$-simplex into $d+1$ new ones via a new vertex (the case $d=2$ is known as an Appolonian…

Combinatorics · Mathematics 2022-01-11 Eyal Lubetzky , Yuval Peled

In 1987 Brehm and K\"uhnel showed that any triangulation of a $d$-manifold (without boundary) that is not homeomorphic to the sphere has at least $3d/2+3$ vertices. Moreover, triangulations with exactly $3d/2+3$ vertices may exist only for…

Combinatorics · Mathematics 2024-11-20 Alexander A. Gaifullin

Let $S$ be the sphere of dimension $n-1, n\geq 4$. Let $(\pi_{\lambda})_{\lambda\in \mathbb C}$ be the scalar principle series of representations of the conformal group $SO_0(1,n)$, realized on $\mathcal C^\infty(S)$. For $\boldsymbol…

Representation Theory · Mathematics 2017-10-24 Jean-Louis Clerc

We study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not…

Metric Geometry · Mathematics 2020-12-21 Shigeki Akiyama

We give three constructions of a vertex-minimal triangulation of $4$-dimensional real projective space $\mathbb{R}P^4$. The first construction describes a $4$-dimensional sphere on $32$ vertices, which is a double cover of a triangulated…

Combinatorics · Mathematics 2014-12-16 Sonia Balagopalan

We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…

Combinatorics · Mathematics 2009-06-18 Olivier Bernardi
‹ Prev 1 8 9 10 Next ›