Finite Affine Groups: Cycle Indices, Hall-Littlewood Polynomials, and Probabilistic Algorithms

Details Finite Affine Groups: Cycle Indices, Hall-Littlewood Polynomials, and Probabilistic Algorithms Finite Affine Groups: Cycle Indices, Hall-Littlewood Polynomials, and Probabilistic Algorithms

2000-09-19

arxiv.org/abs/math/0009182v2

Mathematics

Group Theory

Revised version, to appear in J. Algebra. A few typos are fixed; no substantive changes

Scientific paper

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of this measure are given--three using symmetric function theory and one using Markov chains. This leads to non-trivial enumerative results. Cycle index generating functions are derived and are used to compute the large dimension limiting probabilities that an element of the affine group is separable, cyclic, or semisimple and to study the convergence to these limits. This yields the first examples of such computations for a maximal parabolic subgroup of a finite classical group.

Affiliated with

Also associated with

No associations

Rating

Finite Affine Groups: Cycle Indices, Hall-Littlewood Polynomials, and Probabilistic Algorithms 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 Finite Affine Groups: Cycle Indices, Hall-Littlewood Polynomials, and Probabilistic Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite Affine Groups: Cycle Indices, Hall-Littlewood Polynomials, and Probabilistic Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367771