Bounded Generation by semi-simple elements: quantitative results

DOI10.5802/CRMATH.376MaRDI QIDQ6392524arXivFDO

Authors Pietro Corvaja, Julian Demeio, Andrei Rapinchuk, Jinbo Ren, Umberto Zannier

Publication date 1 March 2022

Published in arXiv

Full work available at URL https://doi.org/10.5802/CRMATH.376

Mathematics Subject Classification ID

Diophantine inequalities (11D75) Structure of modular groups and generalizations; arithmetic groups (11F06) Diophantine inequalities (11J25) Schmidt Subspace Theorem and applications (11J87)

arXiv classification

math.NT

Abstract: We prove that for a number field $F$, the distribution of the points of a set $Sigmasubsetmathbb{A}_F^n$ with a purely exponential parametrization, for example a set of matrices boundedly generated by semi-simple (diagonalizable) elements, is of at most logarithmic size when ordered by height. As a consequence, one obtains that a linear group $Gammasubsetmathrm{GL}_n(K)$ over a field $K$ of characteristic zero admits a purely exponential parametrization if and only if it is finitely generated and the connected component of its Zariski closure is a torus. Our results are obtained via a key inequality about the heights of minimal $m$-tuples for purely exponential parametrizations. One main ingredient of our proof is Evertse's strengthening of the $S$-Unit Equation Theorem.

This page was built for publication: Bounded Generation by semi-simple elements: quantitative results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392524)