Search arXivSearch

arXiv · math/9704227

Diagrams of classifying spaces and $k$-fold Boolean algebras

Abstract

In this paper we study the problem of determining the homology groups of a quotient of a topological space by an action of a group. The method is to represent the original topological space as a homotopy limit of a diagram, and then act with the group on that diagram. Once it is possible to understand what the action of the group on every space in the diagram is, and what it does to the morphisms, we can compute the homology groups of the homotopy limit of this quotient diagram. Our motivating example is the symmetric deleted join of a simplicial complex. It can be represented as a diagram of symmetric deleted products. In the case where the simplicial complex in question is a simplex, we perform the complete computation of the homology groups with $\mathbb Z_p$ coefficients. For the infinite simplex the spaces in the quotient diagram are classifying spaces of various direct products of symmetric groups and diagram morphisms are induced by group homomorphisms. Combining Nakaoka's description of the $\mathbb Z_p$-homology of the symmetric group with a spectral sequence, we reduce the computation to an essentially combinatorial problem, which we then solve using the braid stratification of a sphere. Finally, we give another description of the problem in terms of posets and complete the computation for the case of a finite simplex.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eric Babson, Dmitry Kozlov. 1997-04-29. Diagrams of classifying spaces and $k$-fold Boolean algebras. https://arxiv.org/abs/math/9704227

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