Search arXiv⌕ Search

arXiv · 0706.0790

Free Actions of Finite Groups on $S^n \times S^n$

Abstract

Let $p$ be an odd prime. We construct a non-abelian extension $Γ$ of $S^1$ by $Z/p \times Z/p$, and prove that any finite subgroup of $Γ$ acts freely and smoothly on $S^{2p-1} \times S^{2p-1}$. In particular, for each odd prime $p$ we obtain free smooth actions of infinitely many non-metacyclic rank two $p$-groups on $S^{2p-1} \times S^{2p-1}$. These results arise from a general approach to the existence problem for finite group actions on products of equidimensional spheres.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ian Hambleton, Ozgun Unlu. 2009-03-03. Free Actions of Finite Groups on $S^n \times S^n$. https://arxiv.org/abs/0706.0790

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

KEEP EXPLORING

Related papers

A derived Chouinard's theorem for infinite groups

We establish a Chouinard-type theorem for modules over algebras of cochains on the classifying spaces of a broad class of infinite groups, allowing commutative ring spectra as coefficients. We then use this result to study finiteness properties of the integral cohomology rings of certain infinite groups, as well as stratification of the corresponding module categories. In particular, we complete the (co)stratification of module categories associated to homotopical groups over fields of positive characteristic.

math.AT↗

Galois Connections in Persistent Homology

We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings. Second, it provides access to Rota's Galois connection theorem -- a powerful tool with many potential applications in applied topology. To illustrate this, we use Rota's Galois connection theorem to give a substantially easier proof of the bottleneck stability theorem. Finally, we use this language to establish relationships between various notions of multiparameter persistence diagrams.

math.AT↗