Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.20717

Shellability of relative squeezed balls and spheres

Luz Elena Grisales Gómez
View original source ↗Read source document ↗Export metadata ↓

Abstract

Squeezed balls and spheres, introduced by Kalai, form a rich class of triangulated complexes arising from subcomplexes of cyclic polytopes, with well-understood shellability properties. Recently, Novik and Zheng introduced relative squeezed balls, obtained as differences of squeezed balls, and used them to construct large families of highly neighborly simplicial spheres. While these complexes are known to be constructible, their shellability has remained open. In this paper, we resolve this question by proving that both relative squeezed balls and their boundary complexes are shellable. We provide explicit shelling orders and characterize restriction faces, thereby establishing strong combinatorial structure for this new class of complexes.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luz Elena Grisales Gómez. 2026-07-22. Shellability of relative squeezed balls and spheres. https://arxiv.org/abs/2607.20717

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗