A Representation of Permutations with Full Cycle

Details A Representation of Permutations with Full Cycle A Representation of Permutations with Full Cycle

2010-05-12

arxiv.org/abs/1005.2019v1

Mathematics

Number Theory

5 pages

Scientific paper

For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the prime field F_p, where p is an odd prime. We use the isomorphism between the symmetric group S_p of p elements and the group of PPs over F_p, and the well-known fact that permutations in S_p have the same cycle structure if and only if they are conjugate.

Affiliated with

Also associated with

No associations

Rating

A Representation of Permutations with Full Cycle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Representation of Permutations with Full Cycle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Representation of Permutations with Full Cycle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499049