2 citations · 2 across the 3 of their papers we have counts for
6 papers · 1 filter
The closures of wreath products in product action
I. Ponomarenko, A. V. Vasil'ev
Let be a positive integer and let be a finite set. The -closure of Sym is the largest permutation group on having the same orbits as in its induced ac…
Factoring nonabelian finite groups into two subsets
Ravil Bildanov, Vadim Goryachenko, Andrey Vasil'ev
A group is said to be factorized into subsets if every element in can be uniquely represented as , where $g_i\in…
The proper definition and Wielandt-Hartley's theorem for submaximal -subgroups
Danila Revin, Saveliy Skresanov, Andrey Vasil'ev
A nonempty class of finite groups is called complete if it is closed under taking subgroups, homomorphic images and extensions. We deal with a classical problem of d…
The graph of atomic divisors and constructive recognition of finite simple groups
Alexander A. Buturlakin, Andrey V. Vasil'ev
The spectrum of a finite group is the set of orders of elements of . We present a polynomial-time algorithm that, given a finite set of positive integers…
-Closure of -transitive group in polynomial time
Andrey V. Vasil'ev, Dmitry Churikov
Let be a permutation group on a finite set . The -closure of the group is the largest subgroup of having the same orbits as on t…
What do Frobenius's, Solomon's, and Iwasaki's theorems on divisibility in groups have in common?
Elena K. Brusyanskaya, Anton A. Klyachko, Andrey V. Vasil'ev
Our result contains as special cases the Frobenius theorem (1895) on the number of solutions to the equation in a group, the Solomon theorem (1969) on the number of solutio…