D. Dona

activity

20172024

most citedGraph isomorphisms in quasi-polynomial time

21 citations · 21 across the 3 of their papers we have counts for

collaborators

Showing math.GRShow all

3 papers · 1 filter

math.GR2024

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

Daniele Dona

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 $…

math.GR2022

Arithmetic Monodromy in Sp(2n)

Jitendra Bajpai, Daniele Dona, Martin Nitsche

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…

math.GR2017★ 21 cited

Graph isomorphisms in quasi-polynomial time

Harald Andrés Helfgott, Jitendra Bajpai, Daniele Dona

Let us be given two graphs $Γ_{1}$ , $Γ_{2}$ of $n$ vertices. Are they isomorphic? If they are, the set of isomorphisms from $Γ_{1}$ to $Γ_{2}$ can be identified with a coset $H \cdot π$ insi…