Related papers: Many neighborly spheres

We construct infinitely many smooth oriented 4-manifolds containing pairs of homotopic, smoothly embedded 2-spheres that are not topologically isotopic, but that are equivalent by an ambient diffeomorphism inducing the identity on homology.…

It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…

We introduce the $k$-stellated spheres and compare and contrast them with $k$-stacked spheres. It is shown that for $d \geq 2k$, any $k$-stellated sphere of dimension $d$ bounds a unique and canonically defined $k$-stacked ball. In…

In 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of simplicial spheres. He proved that, for any simplicial complex $\Delta$ on the vertex set $V$ with $\Delta \ne 2^V$, the deleted join of $\Delta$ with…

In this paper we present a new technique to construct neighborly polytopes, and use it to prove a lower bound of ((r+d)^((r/2+d/2)^2))/(r^((r/2)^2)d^((d/2)^2)e^(3rd/4)) for the number of combinatorial types of vertex-labeled neighborly…

Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of…

Let $\mu_{\text{2n}}(d,v)$ (respectively, $\mu^{\text{s}}_{\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \ge 4$. It is known that $\mu_{\text{2n}}(4,v) = v (v-3)/2$,…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

A finite simple graph G is declared to have positive curvature if every in G embedded wheel graph has five or six vertices. A d-graph is a finite simple graph G for which every unit sphere is a (d-1)-sphere. A d-sphere is a d-graph G for…

We prove that every 4-polytope is determined by its edge-polygon incidences, solving an open problem of Gr\"unbaum. For each $d \geq 3$, we show that not every $d$-polytope is determined by its $(d-3)$-skeleton and dual $(d-3)$-skeleton…

We give a complete enumeration of all 2-neighborly 0/1-polytopes of dimension 7. There are 13 959 358 918 different 0/1-equivalence classes of such polytopes. They form 5 850 402 014 combinatorial classes and 1 274 089 different f-vectors.…

A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…

The set of primitive vectors on large spheres in the euclidean space of dimension d>2 equidistribute when projected on the unit sphere. We consider here a refinement of this problem concerning the direction of the vector together with the…

Let $D_{n,\gamma}$ be the complex of graphs on $n$ vertices and domination number at least $\gamma$. We prove that $D_{n,n-2}$ has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques.…

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…

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'…

We construct a large family of neighborly polytopes that can be realized with all the vertices on the boundary of any smooth strictly convex body. In particular, we show that there are superexponentially many combinatorially distinct…

A relationship between real, complex, and quaternionic vector fields on spheres is given by using a relationship between the corresponding standard inner products. The number of linearly independent complex vector fields on the standard…

Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…

We give a complete enumeration of all 2-neighborly $d$-polytopes with $d+9$ and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope $P_{6,10,15}$ with 10 vertices and 15 facets, and pyramids over $P_{6,10,15}$. In…