The Solvable Primitive Permutation Groups of Degree at Most 6560

  • Eick B
  • Höfling B
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

The authors present an algorithm to construct conjugacy class representatives of the solvable primitive subgroups of S d for a given degree d . Using this method, they determine the solvable primitive permutation groups of degree at most 6560 (that is, 3 8 – 1), up to conjugacy.

Cite

CITATION STYLE

APA

Eick, B., & Höfling, B. (2003). The Solvable Primitive Permutation Groups of Degree at Most 6560. LMS Journal of Computation and Mathematics, 6, 29–39. https://doi.org/10.1112/s146115700000036x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free