SearcharxivSearch

arXiv · 1309.6611

Simple groups stabilizing polynomials

Abstract

We study the problem of determining, for a polynomial function $f$ on a vector space $V$, the linear transformations $g$ of $V$ such that $f g = f$. In case $f$ is invariant under a simple algebraic group $G$ acting irreducibly on $V$, we note that the subgroup of $GL(V)$ stabilizing $f$ often has identity component $G$ and we give applications realizing various groups, including the largest exceptional group $E_8$, as automorphism groups of polynomials and algebras. We show that starting with a simple group $G$ and an irreducible representation $V$, one can almost always find an $f$ whose stabilizer has identity component $G$ and that no such $f$ exists in the short list of excluded cases. This relies on our core technical result, the enumeration of inclusions $G < H \le SL(V)$ such that $V/H$ has the same dimension as $V/G$. The main results of this paper are new even in the special case where $k$ is the complex numbers.

Explore related subjects

Keep this discovery

BibTeXRIS

Skip Garibaldi, Robert Guralnick. 2015-04-28. Simple groups stabilizing polynomials. https://doi.org/10.1017/fmp.2015.3

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