Generating Transitive Permutation Groups

نویسنده

  • M. F. NEWMAN
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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....

متن کامل

Finite Transitive Permutation Groups and Finite Vertex-Transitive Graphs

The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...

متن کامل

An O'nan-scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-arc Transitive Graphs

A permutation group is said to be quasiprimitive if each of its nontrivial normal subgroups is transitive. A structure theorem for finite quasiprimitive permutation groups is proved, along the lines of the O'NanScott Theorem for finite primitive permutation groups. It is shown that every finite, non-bipartite, 2-arc transitive graph is a cover of a quasiprimitive 2-arc transitive graph. The str...

متن کامل

On the nonexistence of completely transitive codes

Completely transitive codes were introduced by P. Solé as a special case of binary linear completely regular codes. The existence of such codes is closely related to the existence of certain permutation groups. The nonexistence of highly transitive permutation groups allows us to prove the nonexistence of completely transitive codes with error-correcting capability greater than 4.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006