2 citations · 3 across the 6 of their papers we have counts for
6 papers
The graph isomorphism problem is polynomial
Aleksandr Golubchik
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algo…
The -orbit theory and polycirculant conjecture
Aleksandr Golubchik
The paper contains a proof of the conjecture of M. Klin and D. Marui that an automorphism group of a transitive graph contains a permutation, decompos…
The -orbit theory and Fein-Kantor-Schacher Theorem
Aleksandr Golubchik
By the investigation of -orbits symmetry properties it is obtained a simple proof of the B. Fein, W. M. Kantor and M. Schacher Theorem: any transitive permutation group contains…
On the nature of finite groups
Aleksandr Golubchik
The reality of the difficulties in investigation of finite groups are considered. It is shown that the consideration of symmetry properties of the -orbits that are obtained with…
On the polycirculant conjecture
Aleksandr Golubchik
In the paper the foundation of the -orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations be…
The polynomial algorithm for graphs' isomorphism testing
Aleksandr Golubchik
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism grou…