SearcharxivSearch

arXiv · 1810.05378

On refined Bruhat decompositions and endomorphism algebras of Gelfand-Graev representations

Abstract

Let $G$ be a finite reductive group defined over $\mathbb{F}_q$, with $q$ a power of a prime $p$. Motivated by a problem recently posed by C. Curtis, we first develop an algorithm to express each element of $G$ into a canonical form in terms of a refinement of a Bruhat decomposition, and we then use the output of the algorithm to explicitly determine the structure constants of the endomorphism algebra of a Gelfand-Graev representation of $G$ when $G=\mathrm{PGL}_3(q)$ for an arbitrary prime $p$, and when $G=\mathrm{SO}_5(q)$ for $p$ odd.

Explore related subjects

Keep this discovery

BibTeXRIS

Alessandro Paolini, Iulian I. Simion. 2018-10-12. On refined Bruhat decompositions and endomorphism algebras of Gelfand-Graev representations. https://arxiv.org/abs/1810.05378

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