Polynomial-time normalizers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

Polynomial-time normalizers


For an integer constant d \textgreater 0, let Gamma(d) denote the class of finite groups all of whose nonabelian composition factors lie in S-d; in particular, Gamma(d) includes all solvable groups. Motivated by applications to graph-isomorphism testing, there has been extensive study of the complexity of computation for permutation groups in this class. In particular, the problems of finding set stabilizers, intersections and centralizers have all been shown to be polynomial-time computable. A notable open issue for the class Gamma(d) has been the question of whether normalizers can be found in polynomial time. We resolve this question in the affirmative. We prove that, given permutation groups G, H \textless= Sym(Omega) such that G is an element of Gamma(d), the normalizer of H in G can be found in polynomial time. Among other new procedures, our method includes a key subroutine to solve the problem of finding stabilizers of subspaces in linear representations of permutation groups in Gamma(d).
Fichier principal
Vignette du fichier
2058-6664-1-PB.pdf (517.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00990473 , version 1 (13-05-2014)



Eugene M. Luks, Takunari Miyazaki. Polynomial-time normalizers. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 4 (4), pp.61--96. ⟨10.46298/dmtcs.531⟩. ⟨hal-00990473⟩


56 View
793 Download



Gmail Facebook Twitter LinkedIn More