SearcharxivSearch

arXiv · 2001.07096

The stabilizer of a column in a matrix group over a polynomial ring

Abstract

An original non-standard approach to describing the structure of a column stabilizer in a group of $n \times n$ matrices over a polynomial ring or a Laurent polynomial ring of $n$ variables is presented. The stabilizer is described as an extension of a subgroup of a rather simple structure using the $(n-1) \times (n-1)$ matrix group of congruence type over the corresponding ring of $n-1$ variables. In this paper, we consider cases where $n \leq 3.$ For $n = 2$, the stabilizer is defined as a one-parameter subgroup, and the proof is carried out by direct calculation. The case $n = 3$ is nontrivial; the approach mentioned above is applied to it. Corollaries are given to the results obtained. In particular, we prove that for the stabilizer in the question, it is not generated by its a finite subset together with the so-called tame stabilizer of the given column. We are going to study the cases when $n \geq 4$ in a forthcoming paper. Note that a number of key subgroups of the groups of automorphisms of groups are defined as column stabilizers in matrix groups. For example, this describes the subgroup IAut($M_r$) of automorphisms that are identical modulo a commutant of a free metabelian group $M_r$ of rank $r$. This approach demonstrates the parallelism of theories of groups of automorphisms of groups and matrix groups that exists for a number of well-known groups. This allows us to use the results on matrix groups to describe automorphism groups. In this work, the classical theorems of Suslin, Cohn, as well as Bachmuth and Mochizuki are used.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vitaly Roman'kov. 2020-01-20. The stabilizer of a column in a matrix group over a polynomial ring. https://doi.org/10.17223/20710410%2F48%2F4

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