Search arXivSearch

arXiv · 2005.01155

New families of highly neighborly centrally symmetric spheres

Abstract

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 constructed a cs triangulation of a $d$-sphere with $2n$ vertices, $Δ^d_n$, that is cs-$\lceil d/2\rceil$-neighborly. Here, several new cs constructions, related to $Δ^d_n$, are provided. It is shown that for all $k>2$ and a sufficiently large $n$, there is another cs triangulation of a $(2k-1)$-sphere with $2n$ vertices that is cs-$k$-neighborly, while for $k=2$ there are $Ω(2^n)$ such pairwise non-isomorphic triangulations. It is also shown that for all $k>2$ and a sufficiently large $n$, there are $Ω(2^n)$ pairwise non-isomorphic cs triangulations of a $(2k-1)$-sphere with $2n$ vertices that are cs-$(k-1)$-neighborly. The constructions are based on studying facets of $Δ^d_n$, and, in particular, on some necessary and some sufficient conditions similar in spirit to Gale's evenness condition. Along the way, it is proved that Jockusch's spheres $Δ^3_n$ are shellable and an affirmative answer to Murai--Nevo's question about $2$-stacked shellable balls is given.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isabella Novik, Hailun Zheng. 2022-01-10. New families of highly neighborly centrally symmetric spheres. https://arxiv.org/abs/2005.01155

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO