Constructing transitive permutation groups
نویسنده
چکیده
This paper presents a new algorithm to classify all transitive subgroups of the symmetric group up to conjugacy. It has been used to determine the transitive groups of degree up to 30.
منابع مشابه
Finite Edge-transitive Cayley Graphs and Rotary Cayley Maps
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley graphs (normal, bi-normal, and corefree), and analysing several operations of Cayley graphs (core quotient, normal quotient, and imprimitive quotient). It provides methods for constructing and characterising various c...
متن کاملPathological and Highly Transitive Representations of Free Groups
A well-known result by P. Cameron provides us with a construction of the free group of rank 2א0 within the automorphism group of the rationals. We show that the full versatility of doubly transitive automorphism groups is not necessary by extending Cameron’s construction to a larger class of permutation groups and generalize his result by constructing pathological (permutations of unbounded sup...
متن کاملConstructing error-correcting binary codes using transitive permutation groups
Let A2(n, d) be the maximum size of a binary code of length n and minimum distance d. In this paper we present the following new lower bounds: A2(18, 4) ≥ 5632, A2(21, 4) ≥ 40960, A2(22, 4) ≥ 81920, A2(23, 4) ≥ 163840, A2(24, 4) ≥ 327680, A2(24, 10) ≥ 136, and A2(25, 6) ≥ 17920. The new lower bounds are a result of a systematic computer search over transitive permutation groups.
متن کاملAbstract Groups as Doubly Transitive Permutation Groups *
Groups as Doubly Transitive Permutation Groups *
متن کاملPERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 39 شماره
صفحات -
تاریخ انتشار 2005