Search arXivSearch

arXiv · 1505.04196

Representation stability for cohomology of configuration spaces in $\mathbf{R}^d$

Abstract

This paper studies representation stability in the sense of Church and Farb for representations of the symmetric group $S_n$ on the cohomology of the configuration space of $n$ ordered points in $\mathbf{R}^d$. This cohomology is known to vanish outside of dimensions divisible by $d-1$; it is shown here that the $S_n$-representation on the $i(d-1)^{st}$ cohomology stabilizes sharply at $n=3i$ (resp. $n=3i+1$) when $d$ is odd (resp. even). The result comes from analyzing $S_n$-representations known to control the cohomology: the Whitney homology of set partition lattices for $d$ even, and the higher Lie representations for $d$ odd. A similar analysis shows that the homology of any rank-selected subposet in the partition lattice stabilizes by $n\geq 4i$, where $i$ is the maximum rank selected. Further properties of the Whitney homology and more refined stability statements for $S_n$-isotypic components are also proven, including conjectures of J. Wiltshire-Gordon.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patricia Hersh, Victor Reiner. 2015-12-11. Representation stability for cohomology of configuration spaces in $\mathbf{R}^d$. https://arxiv.org/abs/1505.04196

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