Related papers: The strong approximation theorem and computing wit…

We show that a surface group contained in a reductive real algebraic group can be deformed to become Zariski dense, unless its Zariski closure acts transitively on a Hermitian symmetric space of tube type. This is a kind of converse to a…

Logarithms of determinants of large positive definite matrices appear ubiquitously in machine learning applications including Gaussian graphical and Gaussian process models, partition functions of discrete graphical models, minimum-volume…

Sofic and hyperlinear groups are the countable discrete groups that can be approximated in a suitable sense by finite symmetric groups and groups of unitary matrices. These notions turned out to be very deep and fruitful, and stimulated in…

We introduce special classes of irreducible representations of groups: thick representations and dense representations. Denseness implies thickness, and thickness implies irreducibility. We show that absolute thickness and absolute…

An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.

We classify all real and strongly real classes of the finite special unitary group $SU_n(q)$. Unless $q \equiv 3 (mod 4)$ and $n |4$, the classification of real classes is similar to that of the finite special linear group $SL_n(q)$. We…

We prove that for a connected, semisimple linear Lie group $G$ the spaces of generating pairs of elements or subgroups are well-behaved in a number of ways: the set of pairs of elements generating a dense subgroup is Zariski-open in the…

This book provides a gentle introduction to the study of arithmetic subgroups of semisimple Lie groups. This means that the goal is to understand the group SL(n,Z) and certain of its subgroups. Among the major results discussed in the later…

This paper studies theoretically and empirically a method of turning machine-learning algorithms into probabilistic predictors that automatically enjoys a property of validity (perfect calibration) and is computationally efficient. The…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

We initiate a new, computational approach to a classical problem: certifying non-freeness of ($2$-generator, parabolic) M\"{o}bius subgroups of $\mathrm{SL}(2,\mathbb{Q})$. The main tools used are algorithms for Zariski dense groups and…

A soluble pro-p group of finite rank is finitely axiomatizable in the class of all profinite groups if and only if for each open subgroup H, the image of Z(H) in the abelianization of H is finite, subject to some suitable hypothesis of…

In various classes of infinite groups, we identify groups that are presentable by products, i.e. groups having finite index subgroups which are quotients of products of two commuting infinite subgroups. The classes we discuss here include…

We present connections between the recent literature on multigroup fairness for prediction algorithms and classical results in computational complexity. Multiaccurate predictors are correct in expectation on each member of an arbitrary…

We construct generating pairs of simple Lie algebras in characteristic zero. We apply this construction to exhibit infinite series of 2-generator Zariski dense subgroups that are free of rank 2 of the simple algebraic groups SL(n, C), Sp(n,…

We provide efficient algorithms to compute convergents of quadratic irrationals. We show that for square roots, provided Galois' refinement of Lagrange's theorem holds, certain decimations of the sequence of convergents are signed Chebyshev…

The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…

Let $k$ be a finitely generated field, let $X$ be an algebraic variety and $G$ a linear algebraic group, both defined over $k$. Suppose $G$ acts on $X$ and every element of a Zariski-dense semigroup $\Gamma \subset G(k)$ has a rational…

We extend classical density theorems of Borel and Dani--Shalom on lattices in semisimple, respectively solvable algebraic groups over local fields to approximate lattices. Our proofs are based on the observation that Zariski closures of…

This is an informal announcement of results to be described and proved in detail in a paper to appear. We give various results on the structure of approximate subgroups in linear groups such as $\SL_n(k)$. For example, generalising a result…