Finding the automorphism group of a circulant association scheme in polynomial time

DOI10.1007/s10958-006-0217-4zbMath1100.05105OpenAlexW2312269157MaRDI QIDQ3022123

Ilya Nikolaevich Ponomarenko

Publication date: 22 June 2005

Published in: Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226424

zbMATH Keywords

permutation groupsautomorphism groupspolynomial-time algorithmsregular cyclic subgroupscirculant association schemes

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Association schemes, strongly regular graphs (05E30)

Related Items (2)

Generalized dihedral CI-groups ⋮ Two-closures of supersolvable permutation groups in polynomial time

This page was built for publication: Finding the automorphism group of a circulant association scheme in polynomial time