Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1701.02194

Explicit generators of some pro-p groups via Bruhat-Tits theory

Benoit Loisel
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a semisimple group over a local field of residual characteristic p, its topological group of rational points admits maximal pro-p-subgroups. Quasi-split simply-connected semisimple groups can be described in the combinatorial terms of valued root groups, thanks to Bruhat-Tits theory. In this context, it becomes possible to compute explicitly a minimal generating set of the (all conjugated) maximal pro-p-subgroups thanks to parametrizations of a suitable maximal torus and of corresponding root groups. We show that the minimal number of generators is then linear with respect to the rank of a suitable root system.

Explore related subjects

math.GRmath.AG

Keep this discovery

BibTeXRIS

Benoit Loisel. 2017-01-09. Explicit generators of some pro-p groups via Bruhat-Tits theory. https://arxiv.org/abs/1701.02194

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗