Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.10590

Brauer's 14th Problem and Dyson's Tenfold Way

Dmitriy Rumynin·James Taylor
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider Brauer's 14th Problem in the context of "Real" structures on finite groups and their antilinear representations. The problem is to count the number of characters of each different type using "group theory". While Brauer's original problem deals only with three types (real, complex and quaternionic), here we consider the ten types coming from Dyson's tenfold way.

Explore related subjects

math.GRmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dmitriy Rumynin, James Taylor. 2025-03-13. Brauer's 14th Problem and Dyson's Tenfold Way. https://arxiv.org/abs/2503.10590

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↗