Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1512.00080

A new shellability proof of an identity of Dixon

Ruth Davidson·Augustine O'Keefe·Daniel Parry
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give a new proof of an old identity of Dixon (1865-1936) that uses tools from topological combinatorics. Dixon's identity is re-established by constructing an infinite family of non-pure simplicial complexes $Δ(n)$, indexed by the positive integers, such that the alternating sum of the numbers of faces of $Δ(n)$ of each dimension is the left-hand side of the identity. We show that $Δ(n)$ is shellable for all $n$. Then, using the fact that a shellable simplicial complex is homotopy equivalent to a wedge of spheres, we compute the Betti numbers of $Δ(n)$ by counting (via a generating function) the number of facets of $Δ(n)$ of each dimension that attach along their entire boundary in the shelling order. In other words, Dixon's identity is re-established by using the Euler-Poincaré relation.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruth Davidson, Augustine O'Keefe, Daniel Parry. 2016-05-10. A new shellability proof of an identity of Dixon. https://arxiv.org/abs/1512.00080

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↗