52
Views
22
CrossRef citations to date
0
Altmetric
Original Article

The Transitive Permutation Groups of Degree 32

&
Pages 307-314 | Published online: 30 Jan 2011

  • Wieb Bosma and Bart de Smit. "Class Number Relations from a Computational Point of View." J. Symbolic Comput. 31 (2001), 97–112.
  • Wieb Bosma and Bart de Smit. "On Arithmetically Equivalent Number Fields of Small Degree." In Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci. 2369, pp. 67–79. Berlin: Springer, 2002.
  • Wieb Bosma, John Cannon, and Catherine Playoust. "The Magma Algebra System I: The User Language." J. Symbolic Comput. 24 (1997), 235–265.
  • G. Butler. "The Transitive Groups of Degree Fourteen and Fifteen." J. Symbolic Comput. 16 (1993), 413–422.
  • G. Butler and J. McKay. "The Transitive Groups of Degree up to 11." Comm. Algebra 11 (1983), 863–911.
  • J. J. Cannon and D. F. Holt. "Computing Maximal Subgroups of Finite Groups." J. Symbolic Comput. 37 (2004), 589–609.
  • J. J. Cannon, B. C. Cox, and D. F. Holt. "Computing the Subgroups of a Permutation Group." J. Symbolic Comput. 31 (2001), 149–161.
  • The GAP Group. "GAP: Groups, Algorithms, and Programming, Version 4.4." Available online (http://www. gap-system.org), 2004. http://www. gap-system.org
  • K. Geissler and J. Klüners. "Galois Group Computation for Rational Polynomials." J. Symbolic Comput. 30 (2000), 653–674.
  • A. Hulpke. "Konstruktion transitiver Permutationsgruppen." PhD thesis, RWTH Aachen, 1996.
  • A. Hulpke. "Constructing Transitive Permutation Groups." J. Symbolic Comput. 39 (2005), 1–30.
  • J. Klüners and G. Malle. "Explicit Galois Realization of Transitive Groups of Degree up to 15." J. Symbolic Comput. 30 (2000), 675–716.
  • J. S. Leon. "Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms." J. Symbolic Comput. 12 (1991), 533–583.
  • J. S. Leon. "Partitions, Refinements, and Permutation Group Computation." In Groups and Computation II, edited by Larry Finkelstein and William M. Kantor, pp. 123–158, Amer. Math. Soc. DIMACS Series 28 (DIMACS, 1995), 1997.
  • Brendan D. McKay and Gordon F. Royle. "The Transitive Graphs with at Most 26 Vertices." Ars Combin. 30 (1990), 161–176.
  • Pogerolov, B. A. "Primitive Permutation Groups of Small Degrees, I and II." Algebra and Logic 19 (19070), 230–254 and 278–296.
  • C. M. Roney-Dougal. "The Primitive Groups of Degree Less Than 2500." J. Algebra 292 (2005), 154–183.
  • R. P. Stauduhar. "The Determination of Galois Groups." Math. Comp. 27 (1973), 981–996.
  • C. M. Roney-Dougal and W. R. Unger. "The Affine Primitive Permutation Groups of Degree Less Than 1000." J. Symbolic Comput. 35 (2003), 421–439.
  • Gordon F. Royle. "The Transitive Groups of Degree Twelve." J. Symbolic Comput. 4 (1987), 255–268.
  • Gordon F. Royle and Cheryl E. Praeger. "Constructing the Vertex-Transitive Graphs of Order 24." J. Symbolic Comput. 8 (2989), 309–326.
  • M. W. Short. The Primitive Soluble Permutation Groups of Degree Less than 256, Lecture Notes in Math., 1519. New York: Springer-Verlag, 1992.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.