SearcharxivSearch

arXiv · 2608.18934

Products of trees and ${\rm PGL}_2$-torsors over the punctured affine line

Abstract

The goal of this article is to present a computation of the Galois cohomology of the group $G = \mathrm{PGL}_2$ over rings of Laurent polynomials. This computation recovers the main result of \cite{CGP} in this case by a new method, based on the analysis of actions on appropriate geometric objects (products of trees and, in general, of affine buildings), which was already used in \cite{ARR} to give a new proof of the theorem of Raghunathan-Ramanathan \cite{RR} concerning Galois cohomology over polynomial rings. Going beyond Galois cohomology, this method also enables one to determine the finite subgroups in the group of points over relevant polynomial rings. In view of these and other potential applications of the method in different situations (in particular, in the study of algebraic groups over the coordinate rings of general affine curves), we have attempted to make our exposition largely self-contained and accessible to broad mathematical audience.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrei S. Rapinchuk, Igor A. Rapinchuk, Avinash Roy. 2026-08-19. Products of trees and ${\rm PGL}_2$-torsors over the punctured affine line. https://arxiv.org/abs/2608.18934

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