|
Zapiski Nauchnykh Seminarov POMI, 2005, Volume 321, Pages 251–267
(Mi znsl418)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Finding the automorphism group of a circulant association scheme in polynomial time
I. N. Ponomarenko St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Abstract:
We construct a polynomial-time algorithm for finding the
automorphism group of a circulant association scheme. The
correctness of the algorithm is based on a new result
generalizing the Burnside–Schur theorem (on permutation
groups having a regular cyclic subgroup) in the class of
the automorphism groups of association schemes.
Received: 25.11.2004
Citation:
I. N. Ponomarenko, “Finding the automorphism group of a circulant association scheme in polynomial time”, Problems in the theory of representations of algebras and groups. Part 12, Zap. Nauchn. Sem. POMI, 321, POMI, St. Petersburg, 2005, 251–267; J. Math. Sci. (N. Y.), 136:3 (2006), 3972–3979
Linking options:
https://www.mathnet.ru/eng/znsl418 https://www.mathnet.ru/eng/znsl/v321/p251
|
Statistics & downloads: |
Abstract page: | 245 | Full-text PDF : | 99 | References: | 36 |
|