Searcharxiv⌕ Search

arXiv · 2610.37703

Simple Torsion-Free Linear Groups from Global Division Algebras

Abstract

We investigate the reduced norm-one group $\mathrm{SL}_1(D)$ of a central division algebra $D$ of odd degree over $\mathbb{Q}$. Using the Brauer-Hasse-Noether theorem and the Margulis-Platonov theorem, we derive a criterion for abstract simplicity in terms of local division completions. For a division algebra of degree $15$ with local invariants $1/3$, $-1/3$, $1/5$, and $-1/5$, the construction yields a candidate example of an infinite, torsion-free, nonabelian simple linear group. This would provide an affirmative answer to Problem 16.78 of the Kourovka Notebook. The argument was generated using an AI system and has not yet been independently verified by human mathematicians.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ivan Samuil Nnuga Mongo. 2026-10-26. Simple Torsion-Free Linear Groups from Global Division Algebras. https://searcharxiv.com/abs/2610.37703

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗