Sylow Groups of Groups of Polynomial Permutations
نویسنده
چکیده
We enumerate and describe the Sylow p-groups of the group of polynomial permutations of the integers mod p . MSC 2000: primary 20D20, secondary 11T06, 13M10, 11C08, 13F20, 20E18.
منابع مشابه
Finding Sylow Normalizers in Polynomial Time
Given a set r of permutations of an n-set, let G be the group of permutations generated by r. I f p is any prime, it is known that a Sylow p-subgroup P of G can be found in polynomial time. We show that the normalizer of P can also be found in polynomial time. In particular, given two Sylow p-subgroups of G, all elements conjugating one to the other can be found (as a coset of the normalizer of...
متن کاملSylow p-groups of polynomial permutations on the integers mod pn
Article history: Received 9 July 2012 Accepted 23 June 2013 Available online 4 September 2013 Communicated by D. Wan MSC: primary 20D20 secondary 11T06, 13M10, 11C08, 13F20, 20E18
متن کاملSylow's Theorem in Polynomial Time
Given a set r of permutations of an n-set, let G be the group of permutations generated by f. If p is a prime, a Sylow p-subgroup of G is a subgroup whose order is the largest power of p dividing IGI. For more than 100 years it has been known that a Sylow p-subgroup exists, and that for any two Sylow p-subgroups PI, P, of G there is an element go G such that Pz = g-‘PI g. We present polynomial-...
متن کاملPolynomial-Time Versions of Sylow's Theorem
Let G be a subgroup of S,, given in terms of a generating set of permutations, and let p be a prime divisor of 1 G 1. If G is solvable-and, more generally, if the nonabelian composition factors of G are suitably restricted-it is shown that the following can be found in polynomial time: a Sylow p-subgroup of G containing a given p-subgroup, and an element of G conjugating a given Sylow p-subgrou...
متن کاملPolynomial-time Isomorphism Test for Groups with Abelian Sylow Towers
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial nlogn bound on the time complexity for the general case has not been improved over the past four decades. Recently, Babai et al. (following Babai et al. in SODA 2011) presented a polynomial-time algorithm for groups without abelian normal subgroups, which suggests solvable groups as the hard ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011