Search arXiv⌕ Search

arXiv · 0705.4081

Examples of Free Actions on Products of Spheres

Abstract

We construct a non-abelian extension $Γ$ of $S^1$ by $\cy 3 \times \cy 3$, and prove that $Γ$ acts freely and smoothly on $S^{5} \times S^{5}$. This gives new actions on $S^{5} \times S^{5}$ for an infinite family $\cP$ of finite 3-groups. We also show that any finite odd order subgroup of the exceptional Lie group $G_2$ admits a free smooth action on $S^{11}\times S^{11}$. This gives new actions on $S^{11}\times S^{11}$ for an infinite family $\cE $ of finite groups. We explain the significance of these families $\cP $, $\cE $ for the general existence problem, and correct some mistakes in the literature.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ian Hambleton, Ozgun Unlu. 2008-06-15. Examples of Free Actions on Products of Spheres. https://arxiv.org/abs/0705.4081

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↗