SearcharxivSearch

arXiv subjects

Daniele Dona

Publications and source records attributed to Daniele Dona.

At least 19 recordsLinked to original sources

A CFSG-free explicit Jordan's theorem over arbitrary fields

We prove a version of Jordan's classification theorem for finite subgroups of $\mathrm{GL}_{n}(K)$ that is at the same time quantitatively explicit, CFSG-free, and valid for arbitrary $K$. This is the first proof to satisfy all three properties at once. Our overall strategy follows Larsen and Pink [24], with explicit computations based on techniques developed by the authors and Helfgott [2, 3], particularly in relation to dimensional estimates.

math.GR

Products of three conjugacy classes in the alternating group

We prove that for $δ$ small, $n$ large, and any three conjugacy classes $C_{1},C_{2},C_{3}$ of $G=\mathrm{Alt}(n)$ of size at least $|G|^{1-δ}$ we have $C_{1}C_{2}C_{3}=G$. The result provides a positive answer to Problem 20.23 of the Kourovka Notebook [KM22], improves theorems of Garonzi and Maróti [GM21] (using $4$ classes) and Rodgers [Rod02] (using larger classes), complements the known result for $G$ a simple group of Lie type [MP21] [LST24] [FM25], and is tight in several senses. Furthermore, since no character theory is involved, the proof can be used in principle to build a constructive algorithm that, given $g\in G$, outputs $c_{i}\in C_{i}$ such that $c_{1}c_{2}c_{3}=g$.

math.GR

The diameter of random Schreier graphs

We give a combinatorial proof of the following theorem. Let $G$ be any finite group acting transitively on a set of cardinality $n$. If $S \subseteq G$ is a random set of size $k$, with $k \geq (\log n)^{1+\varepsilon}$ for some $\varepsilon >0$, then the diameter of the corresponding Schreier graph is $O(\log_k n)$ with high probability. Except for the implicit constant, this result is the best possible.

math.CO

Growth estimates and diameter bounds for untwisted classical groups

Babai's conjecture states that, for any finite simple non-abelian group $G$, the diameter of $G$ is bounded by $(\log|G|)^{C}$ for some absolute constant $C$. We prove that, for any untwisted classical group $G$ of rank $r$ defined over a field $\mathbb{F}_{q}$ with $q$ not too small with respect to $r$, \begin{equation*} \mathrm{diam}(G(\mathbb{F}_{q}))\leq(\log|G(\mathbb{F}_{q})|)^{408r^{4}}. \end{equation*} This bound improves on results by Breuillard, Green, and Tao [9], Pyber and Szabó [38], and, for $q$ large enough, also by Halasi, Maróti, Pyber, and Qiao [16]. Our approach is in several ways closer to that of preexistent work by Helfgott [20], in that we give dimensional estimates (that is, bounds of the form $|A\cap V(\mathbb{F}_{q})|\ll|A^{C}|^{\dim(V)/\dim(G)}$, where $A$ is any generating set) for varieties $V$ of specific types, and work in the Lie algebra whenever possible. One of our main tools is a new, more efficient form of escape from subvarieties.

math.GR

Writing finite simple groups of Lie type as products of subset conjugates

The Liebeck-Nikolov-Shalev conjecture [LNS12] asserts that, for any finite simple non-abelian group $G$ and any set $A\subseteq G$ with $|A|\geq 2$, $G$ is the product of at most $N\frac{\log|G|}{\log|A|}$ conjugates of $A$, for some absolute constant $N$. For $G$ of Lie type, we prove that for any $\varepsilon>0$ there is some $N_{\varepsilon}$ for which $G$ is the product of at most $N_{\varepsilon}\left(\frac{\log|G|}{\log|A|}\right)^{1+\varepsilon}$ conjugates of either $A$ or $A^{-1}$. For symmetric sets, this improves on results of Liebeck, Nikolov, and Shalev [LNS12] and Gill, Pyber, Short, and Szabó [GPSS13]. During the preparation of this paper, the proof of the Liebeck-Nikolov-Shalev conjecture was completed by Lifshitz [Lif24]. Both papers use [GLPS24] as a starting point. Lifshitz's argument uses heavy machinery from representation theory to complete the conjecture, whereas this paper achieves a more modest result by rather elementary combinatorial arguments.

math.GR

Involutions in finite simple groups as products of conjugates

Let $G$ be a finite non-abelian simple group, $C$ a non-identity conjugacy class of $G$, and $Γ_C$ the Cayley graph of $G$ based on $C \cup C^{-1}$. Our main result shows that in any such graph, there is an involution at bounded distance from the identity.

math.GR

New dimensional estimates for subvarieties of linear algebraic groups

For every connected, almost simple linear algebraic group $G\leq\mathrm{GL}_{n}$ over a large enough field $K$, every subvariety $V\subseteq G$, and every finite generating set $A\subseteq G(K)$, we prove a general dimensional bound, that is, a bound of the form \[|A\cap V(\overline{K})|\leq C_{1}|A^{C_{2}}|^{\frac{\dim(V)}{\dim(G)}}\] with $C_{1},C_{2}$ depending only on $n,\mathrm{deg}(V)$. The dependence of $C_1$ on $n$ (or rather on $\dim (V)$) is doubly exponential, whereas $C_2$ (which is independent of $\mathrm{deg}(V)$) depends simply exponentially on $n$. Bounds of this form have proved useful in the study of growth in linear algebraic groups since 2005 (Helfgott) and, before then, in the study of subgroup structure (Larsen-Pink: $A$ a subgroup). In bounds for general $V$ and $G$ available before our work, the dependence of $C_1$ and $C_2$ on $n$ was of exponential-tower type. We draw immediate consequences regarding diameter bounds for untwisted classical groups $G(\mathbb{F}_{q})$. (In a separate paper, we derive stronger diameter bounds from stronger dimensional bounds we prove for specific families of varieties $V$.)

math.GR

Growth of products of subsets in finite simple groups

We prove that the product of a subset and a normal subset inside any finite simple non-abelian group $G$ grows rapidly. More precisely, if $A$ and $B$ are two subsets with $B$ normal and neither of them is too large inside $G$, then $|AB| \geq |A||B|^{1-ε}$ where $ε>0$ can be taken arbitrarily small. This is a somewhat surprising strengthening of a theorem of Liebeck, Schul, Shalev.

math.GR

A sum-bracket theorem for simple Lie algebras

Let $\mathfrak{g}$ be an algebra over $K$ with a bilinear operation $[\cdot,\cdot]:\mathfrak{g}\times\mathfrak{g}\rightarrow\mathfrak{g}$ not necessarily associative. For $A\subseteq\mathfrak{g}$, let $A^{k}$ be the set of elements of $\mathfrak{g}$ written combining $k$ elements of $A$ via $+$ and $[\cdot,\cdot]$. We show a "sum-bracket theorem" for simple Lie algebras over $K$ of the form $\mathfrak{g}=\mathfrak{sl}_{n},\mathfrak{so}_{n},\mathfrak{sp}_{2n},\mathfrak{e}_{6},\mathfrak{e}_{7},\mathfrak{e}_{8},\mathfrak{f}_{4},\mathfrak{g}_{2}$: if $\mathrm{char}(K)$ is not too small, we have growth of the form $|A^{k}|\geq|A|^{1+\varepsilon}$ for all generating symmetric sets $A$ away from subfields of $K$. Over $\mathbb{F}_{p}$ in particular, we have a diameter bound matching the best analogous bounds for groups of Lie type [BDH21]. As an independent intermediate result, we prove also an estimate of the form $|A\cap V|\leq|A^{k}|^{\dim(V)/\dim(\mathfrak{g})}$ for linear affine subspaces $V$ of $\mathfrak{g}$. This estimate is valid for all simple algebras, and $k$ is especially small for a large class of them including associative, Lie, and Mal'cev algebras, and Lie superalgebras.

math.RA

Thin monodromy in $\mathrm{Sp}(4)$ and $\mathrm{Sp}(6)$

We explore the thinness of hypergeometric groups of type $\mathrm{Sp}(4)$ and $\mathrm{Sp}(6)$ by applying a new approach of computer-assisted ping pong. We prove the thinness of $17$ hypergeometric groups with maximally unipotent monodromy in $\mathrm{Sp}(6)$, completing the classification of all $40$ such groups into arithmetic and thin cases. In addition, we establish the thinness of further $46$ hypergeometric groups in $\mathrm{Sp}(6)$, and of $3$ hypergeometric groups in $\mathrm{Sp}(4)$, completing the classification of all $\mathrm{Sp}(4)$ hypergeometric groups. To the best of our knowledge, this article produces the first $63$ examples in the cyclotomic family of Zariski dense non-arithmetic hypergeometric monodromy groups of real rank three.

math.GR

Arithmetic Monodromy in Sp(2n)

Based on a result of Singh--Venkataramana, Bajpai--Dona--Singh--Singh gave a criterion for a discrete Zariski-dense subgroup of Sp(2n,Z) to be a lattice. We adapt this criterion so that it can be used in some situations that were previously excluded. We apply the adapted method to subgroups of Sp(6,Z) and Sp(4,Z) that arise as the monodromy groups of hypergeometric differential equations. In particular, we show that out of the 40 maximally unipotent Sp(6) hypergeometric groups more than half are arithmetic, answering a question of Katz in the negative.

math.GR

On the Atkinson formula for the $ζ$ function

Thanks to Littlewood (1922) and Ingham (1928), we know the first two terms of the asymptotic formula for the square mean integral value of the Riemann zeta function $ζ$ on the critical line. Later, Atkinson (1939) presented this formula with an error term of order $O(\sqrt{T}\log^{2}(T))$, which we call the Atkinson formula. Following the latter approach and the work of Titchmarsh (1986), we present an explicit version of the Atkinson formula, improving on a recent bound by Simonič (2020). Moreover, we extend the Atkinson formula to the range $\Re(s)\in\left[\frac{1}{4},\frac{3}{4}\right]$, giving an explicit bound for the square mean integral value of $ζ$ and improving on a bound by Helfgott and the authors (2019). We use mostly classical tools, such as the approximate functional equation and the explicit convexity bounds of the zeta function given by Backlund (1918).

math.NT

Explicit $L^2$ bounds for the Riemann $ζ$ function

Explicit bounds on the tails of the zeta function $ζ$ are needed for applications, notably for integrals involving $ζ$ on vertical lines or other paths going to infinity. Here we bound weighted $L^2$ norms of tails of $ζ$. Two approaches are followed, each giving the better result on a different range. The first one is inspired by the proof of the standard mean value theorem for Dirichlet polynomials. The second approach, superior for large $T$, is based on classical lines, starting with an approximation to $ζ$ via Euler-Maclaurin. Both bounds give main terms of the correct order for $0<σ\leq 1$ and are strong enough to be of practical use for the rigorous computation of improper integrals. We also present bounds for the $L^{2}$ norm of $ζ$ in $[1,T]$ for $0\leqσ\leq 1$.

math.NT

Topological full groups of minimal subshifts and quantifying local embeddings into finite groups

We investigate quantitative aspects of the LEF property for subgroups of the topological full group $[[ σ]]$ of a two-sided minimal subshift over a finite alphabet, measured via the LEF growth function. We show that the LEF growth of $[[ σ]]^{\prime}$ may be bounded from above and below in terms of the recurrence function and the complexity function of the subshift, respectively. As an application, we construct groups of previously unseen LEF growth types, and exhibit a continuum of finitely generated LEF groups which may be distinguished from one another by their LEF growth.

math.GR

Towards a CFSG-free diameter bound for $\mathrm{Alt}(n)$

Helfgott and Seress have proved the existence of a quasipolynomial upper bound on the diameter of $\mathrm{Alt}(n)$. In this paper, we walk partway towards removing the dependence on CFSG from that result, by using the algorithm solving the string isomorphism problem (due to Babai) in its CFSG-free version (due to Babai and Pyber): the result contained in here relies on the analysis of Babai's algorithm contained in Dona, based in turn on Helfgott. Conditional on a conjecture about certain products of small-indexed subgroups (Conjecture 4.5), we provide a CFSG-free proof of a bound on the diameter of $\mathrm{Alt}(n)$ that is better than the already existing CFSG-free results in the literature. In fact, the same bound holds for all transitive permutation subgroups $G\leq\mathrm{Sym}(n)$. The paper is part of the author's doctoral thesis.

math.GR

On short expressions for cosets of permutation subgroups

Following Babai's algorithm for the string isomorphism problem, we determine that it is possible to write expressions of short length describing certain permutation cosets, including all permutation subgroups; this is feasible both in the original version of the algorithm and in its CFSG-free version, partially done by Babai and completed by Pyber. The existence of such descriptions gives a weak form of the Cameron-Maróti classification even without assuming CFSG. We also thoroughly explicate Babai's recursion process (as given in Helfgott) and obtain explicit constants for the runtime of the algorithm, both with and without the use of CFSG.

math.GR

Symplectic Hypergeometric Groups of Degree Six

Our computations show that there is a total of $40$ pairs of degree six coprime polynomials $f,g$ where $f(x)=(x-1)^6$, $g$ is a product of cyclotomic polynomials, $g(0)=1$ and $f,g$ form a primitive pair. The aim of this article is to determine whether the corresponding $40$ symplectic hypergeometric groups with a maximally unipotent monodromy follow the same dichotomy between arithmeticity and thinness that holds for the $14$ symplectic hypergeometric groups corresponding to the pairs of degree four polynomials $f,g$ where $f(x)=(x-1)^4$ and $g$ is as described above. As a result we prove that at least $18$ of these $40$ groups are arithmetic in $\mathrm{Sp}(6)$. In addition, we extend our search to all degree six symplectic hypergeometric groups. We find that there is a total of $458$ pairs of polynomials (up to scalar shifts) corresponding to such groups. For $211$ of them, the absolute values of the leading coefficients of the difference polynomials $f-g$ are at most $2$ and the arithmeticity of the corresponding groups follows from Singh and Venkataramana, while the arithmeticity of one more hypergeometric group follows from Detinko, Flannery and Hulpke. In this article, we show the arithmeticity of $160$ of the remaining $246$ hypergeometric groups.

math.GR

Number of directions determined by a set in $\mathbb{F}_{q}^{2}$ and growth in $\mathrm{Aff}(\mathbb{F}_{q})$

We prove that a set $A$ of at most $q$ non-collinear points in the finite plane $\mathbb{F}_{q}^{2}$ spans at least $\approx\frac{|A|}{\sqrt{q}}$ directions: this is based on a lower bound contained in [FST13], which we prove again together with a different upper bound than the one given therein. Then, following the procedure used in [RS18], we prove a new structural theorem about slowly growing sets in $\mathrm{Aff}(\mathbb{F}_{q})$ for any finite field $\mathbb{F}_{q}$, generalizing the analogous results in [Hel15] [Mur17] [RS18] over prime fields.

math.CO