I. Ponomarenko

most citedThe

3

-closure of a solvable permutation group is solvable

8 citations · 8 across the 2 of their papers we have counts for

collaborators

2 papers

math.GR2021

The closures of wreath products in product action

I. Ponomarenko, A. V. Vasil'ev

Let $m$ be a positive integer and let $Ω$ be a finite set. The $m$ -closure of $G \leq$ Sym $(Ω)$ is the largest permutation group on $Ω$ having the same orbits as $G$ in its induced ac…

math.GR2020★ 8 cited

The $3$ -closure of a solvable permutation group is solvable

E. A. O'Brien, I. Ponomarenko, A. V. Vasil'ev +1

Let $m$ be a positive integer and let $Ω$ be a finite set. The $m$ -closure of $G \leq Sym (Ω)$ is the largest permutation group on $Ω$ having the same orbits as $G$ in…

The closures of wreath products in product action

The 3-closure of a solvable permutation group is solvable

The $3$ -closure of a solvable permutation group is solvable