Abstract
Computation of normalizers for permutation groups is sometimes very hard even if the degrees are small. The author previously obtained some methods to compute normalizers of permutation groups and wrote programs implementing the methods. The programs were mainly applied to groups of small degree such as transitive groups of degree up to 30 in the GAP library. The author will tune up the implementation to speed up the computation of normalizers of permutation groups and apply it to permutation groups of degree up to 100. In our experiments, the normalizers of the primitive groups up to degree 100 and their stabilizers of one point in the symmetric groups are computed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
The GAP Groups. Gap - groups, algorithms and programming, version 4. Lehrstuhl D für Mathematik, Rheinisch Westfälische Technische Hochschule, Aachen, Germany and School of Mathematical and Computational Sciences. Univ. St. Andrews, Scotland (2000)
Higman, D.G.: Coherent configurations I. Rendiconti del Seminario Matematico della Universit a di Padova 44, 1–25 (1970)
Leon, J.S.: Permutation group algorithms based on partitions, I: Theory and algorithms. J. Symbolic Comput. 1(12), 533–583 (1991)
Leon, J.S.: Partitions, refinements, and permutation group computation. In: Finkelstein, L., Kantor, W.M. (eds.) Groups and Computation II, DIMACS 1995. Amer. Math. Soc. DIMACS Series, vol. 28, pp. 123–158 (1997)
Luks, L.M., Miyazaki, T.: Polynomial-time normalizers for permutation groups with restricted composition factors. In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 176–183 (2002)
Miyamoto, I.: Computing normalizers of permutation groups efficiently using isomorphisms of association schemes. In: Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, pp. 200–204 (2000)
Miyamoto, I.: An improvement of GAP Normalizer function for permutation groups. In: Dumas, J.-G. (ed.) Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp. 234–238 (2006)
Miyamoto, I.: Computation of Isomorphisms of Coherent Configurations. ARS Math. Contemporanea (to appear)
Seress, A.: Permutation Group Algorithms. Cambridge Tracts in Math., vol. 152. Cambridge Univ. Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyamoto, I. (2010). An Improvement of a Function Computing Normalizers for Permutation Groups. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-15582-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15581-9
Online ISBN: 978-3-642-15582-6
eBook Packages: Computer ScienceComputer Science (R0)