English
Related papers

Related papers: Many neighborly spheres

200 papers

Every closed oriented PL 4-manifold is a branched cover of the 4-sphere branched over a PL-surface with finitely many singularities by Piergallini [Topology 34(3):497-508, 1995]. This generalizes a long standing result by Hilden and…

Combinatorics · Mathematics 2007-07-11 Nikolaus Witte

Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…

Combinatorics · Mathematics 2015-01-30 Hiroyuki Miyata , Arnau Padrol

There are two related poset structures, the higher Stasheff-Tamari orders, on the set of all triangulations of the cyclic $d$ polytope with $n$ vertices. In this paper it is shown that both of them have the homotopy type of a sphere of…

Combinatorics · Mathematics 2016-09-07 Paul H. Edelman , Jörg Rambau , Victor Reiner

We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…

Optimization and Control · Mathematics 2022-10-25 Sergiy Borodachov

This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…

Combinatorics · Mathematics 2026-01-21 Ksenia Apolonskaya , Oleg R. Musin

For $d\geq 2$, Walkup's class $\Kd$ consists of the $d$-dimensional simplicial complexes whose vertex-links are stacked $(d-1)$-spheres. Recently Lutz, Sulanke and Swartz have shown that all $\mathbb{F}$-orientable triangulated…

Geometric Topology · Mathematics 2013-06-18 Nitin Singh

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

Combinatorics · Mathematics 2020-08-18 Andrey Kupavskii , Stefan Weltge

Let $E_d(n)$ be the maximum number of pairs that can be selected from a set of $n$ points in $R^d$ such that the midpoints of these pairs are convexly independent. We show that $E_2(n)\geq \Omega(n\sqrt{\log n})$, which answers a question…

Combinatorics · Mathematics 2011-08-26 Konrad J. Swanepoel , Pavel Valtr

It is well known that a compact two dimensional surface is homeomorphic to a polygon with the edges identified in pairs. This paper not only presents a new proof of this statement but also generalizes it for any connected n-dimensional…

General Mathematics · Mathematics 2007-05-23 Sergey Nikitin

Let $\mathscr{X}$ be the boundary complex of a $(d+1)$-polytope, and let $\rho(d+1,k) = \frac{1}{2}[{\lceil (d+1)/2 \rceil \choose d-k} + {\lfloor (d+1)/2 \rfloor \choose d-k}]$. Recently, the author, answering B\'ar\'any's question from…

Combinatorics · Mathematics 2024-09-16 Joshua Hinman

For any positive integer $n$, Lov\'{a}sz-Schrijver, Taniyama and Skopenkov provided examples of simplicial $n$-complexes that inevitably contain a nonsplittable two-component link of $n$-spheres, no matter how they are embedded into the…

Geometric Topology · Mathematics 2025-10-14 Ryo Nikkuni

The $g$-theorem is a momentous result in combinatorics that gives a complete numerical characterization of the face numbers of simplicial convex polytopes. The $g$-conjecture asserts that the same numerical conditions given in the…

Combinatorics · Mathematics 2024-07-02 Kai Fong Ernest Chong , Tiong Seng Tay

In this paper we introduce the notion of a $d$-dimensional cycle which is a homological generalization of the idea of a graph cycle to higher dimensions. We examine both the combinatorial and homological properties of this structure and use…

Algebraic Topology · Mathematics 2013-07-23 Emma Connon

A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…

Combinatorics · Mathematics 2023-11-21 Satoshi Murai , Isabella Novik , Hailun Zheng

The problem of constructing a limit series of Penrose type partitions of a two-dimensional sphere is solved, which makes it possible to model quasicrystals possessing a point icosahedral group symmetry Ih. Images of polyhedron models are…

Materials Science · Physics 2018-04-24 Alexander S. Prokhoda

For each integer $n\ge 2$, we construct infinitely many $n$-component Brunnian links of 3-balls in $S^4$. Our main tool is the third author's result on the existence of splitting spheres for the trivial two-component link of $2$-spheres in…

Geometric Topology · Mathematics 2026-03-09 Seungwon Kim , Gheehyun Nahm , Alison Tatsuoka

We show that isotropic positive definite functions on the $d$-dimensional sphere which are $2k$ times differentiable at zero have $2k+[(d-1)/2]$ continuous derivatives on $(0,\pi)$. This result is analogous to the result for radial positive…

Statistics Theory · Mathematics 2016-03-23 Mara Trübner , Johanna F. Ziegel

In 1988, Kalai extended a construction of Billera and Lee to produce many triangulated (d-1)-spheres. In fact, in view of upper bounds on the number of simplicial d-polytopes by Goodman and Pollack, he derived that for every dimension d>=5,…

Combinatorics · Mathematics 2007-05-23 Julian Pfeifle

Durhuus and Jonsson (1995) introduced the class of "locally constructible" (LC) 3-spheres and showed that there are only exponentially-many combinatorial types of simplicial LC 3-spheres. Such upper bounds are crucial for the convergence of…

Combinatorics · Mathematics 2011-08-19 Bruno Benedetti , Günter M. Ziegler

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