SearcharxivSearch

arXiv · math/0511084

Involutions on the the Barnes-Wall lattices and their fixed point sublattices, I

Abstract

We study the sublattices of the rank $2^d$ Barnes-Wall lattices $\bw d$ which occur as fixed points of involutions. They have ranks $2^{d-1}$ (for dirty involutions) or $2^{d-1}\pm 2^{k-1}$ (for clean involutions), where $k$, the defect, is an integer at most $\frac d 2$. We discuss the involutions on $\bw d$ and determine the isometry groups of the fixed point sublattices for all involutions of defect 1. Transitivity results for the Bolt-Room-Wall group on isometry types of sublattices extend those in \cite{bwy}. Along the way, we classify the orbits of $AGL(d,2)$ on the Reed-Muller codes $RM(2,d)$ and describe {\it cubi sequences} for short codewords, which give them as Boolean sums of codimension 2 affine subspaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert L. Griess Jr. 2005-11-03. Involutions on the the Barnes-Wall lattices and their fixed point sublattices, I. https://arxiv.org/abs/math/0511084

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR