7 citations · 8 across the 16 of their papers we have counts for
18 papers
Polynomial-time isomorphism test for -generated extensions of abelian groups
Saveliy V. Skresanov
The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific gro…
On finite groups with exactly one noncommutator
Saveliy V. Skresanov
An element of a group is a commutator if it can be expressed in the form for some . In 2010 MacHale posed the following problem in the Kour…
Rota-Baxter operators on compact simple Lie groups and algebras
Saveliy V. Skresanov
A Rota-Baxter operator on a Lie group is a smooth map such that for all . This concept was introduced in 2021…
Reduction of the group isomorphism problem to the group automorphism problem
Saveliy V. Skresanov
It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact these two problems are polynomial-time equivalent). We s…
Random unipotent Sylow subgroups of groups of Lie type of bounded rank
Saveliy V. Skresanov
In 2001 Liebeck and Pyber showed that a finite simple group of Lie type is a product of carefully chosen unipotent Sylow subgroups. Later, in a series of works it was shown…
Expanders and growth of normal subsets in finite simple groups of Lie type
Saveliy V. Skresanov
We show that some classical results on expander graphs imply growth results on normal subsets in finite simple groups. As one application, it is shown that given a nontrivial norma…
Closures of permutation groups with restricted nonabelian composition factors
Ilia Ponomarenko, Saveliy V. Skresanov, Andrey V. Vasil'ev
Given a permutation group on a finite set , let denote the -closure of , that is, the largest permutation group on having the same orbits in the induced…
A generalization of the Brauer-Fowler theorem
Saveliy V. Skresanov
The famous Brauer-Fowler theorem states that the order of a finite simple group can be bounded in terms of the order of the centralizer of an involution. Using the classification o…
On the automorphism group of a distance-regular graph
László Pyber, Saveliy V. Skresanov
The motion of a graph is the minimal degree of its full automorphism group. Babai conjectured that the motion of a primitive distance-regular graph on vertices of diameter grea…
On the orders of composition factors in completely reducible groups
Attila Maróti, Saveliy V. Skresanov
We obtain an asymptotic upper bound for the product of the -parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a…
On a polynomial bound for the orbital diameter of primitive affine groups
Saveliy V. Skresanov
Let be a finite primitive affine permutation group, where is a vector space of dimension over the prime field and is an irreducible linear…
Bounds for the diameters of orbital graphs of affine groups
Attila Maróti, Saveliy V. Skresanov
General bounds are presented for the diameters of orbital graphs of finite affine primitive permutation groups. For example, it is proved that the orbital diameter of a finite affi…
Two-closure of rank 3 groups in polynomial time
Saveliy V. Skresanov
A finite permutation group on is called a rank 3 group if it has precisely three orbits in its induced action on . The largest permutation group on having th…
The probabilistic Weisfeiler-Leman algorithm
Saveliy V. Skresanov
A probabilistic version of the Weisfeiler-Leman algorithm for computing the coherent closure of a colored graph is suggested. The algorithm is Monte Carlo and runs in time $ O(n^{1…
On 2-closures of rank 3 groups
Saveliy V. Skresanov
A permutation group on is called a rank 3 group if it has precisely three orbits in its induced action on . The largest permutation group on having the same…
On element orders in covers of and
Mariya A. Grechkoseeva, Saveliy V. Skresanov
Suppose that is one of the finite simple groups or and acts on a vector space over a field whose characteristic divides . We prove that the nat…
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…
Subgroups of minimal index in polynomial time
Saveliy V. Skresanov
Let be a finite group and let be a proper subgroup of of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G :…