SearcharxivSearch

arXiv · 1108.2409

Correction of a theorem on the symmetric group generated by transvections

Abstract

Let $V$ denote a vector space over two-element field $\mathbb F_2$ with finite positive dimension and endowed with a symplectic form $B.$ Let ${\rm SL}(V)$ denote the special linear group of $V.$ Let $S$ denote a subset of $V.$ Define $Tv(S)$ as the subgroup of ${\rm SL}(V)$ generated by the transvections with direction $\alpha$ for all $\alpha\in S.$ Define $G(S)$ as the graph whose vertex set is $S$ and where $\alpha,\beta\in S$ are connected whenever $B(\alpha,\beta)=1.$ A well-known theorem states that under the assumption that $S$ spans $V,$ the following (i), (ii) are equivalent: (i) $Tv(S)$ is isomorphic to a symmetric group. (ii) $G(S)$ is a claw-free block graph. We give an example which shows that this theorem is not true. We give a modification of this theorem as follows. Assume that $S$ is a linearly independent set of $V$ and no element of $S$ is in the radical of $V.$ Then the above (i), (ii) are equivalent.

Explore related subjects

Keep this discovery

BibTeXRIS

Hau-wen Huang. 2011-08-03. Correction of a theorem on the symmetric group generated by transvections. https://arxiv.org/abs/1108.2409

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