GL(n,q) and Increasing Subsequences in Nonuniform Random Permutations

Details GL(n,q) and Increasing Subsequences in Nonuniform Random Permutations GL(n,q) and Increasing Subsequences in Nonuniform Random Permutations

2001-09-12

arxiv.org/abs/math/0109079v2

Mathematics

Combinatorics

Results for longest decreasing subsequence are added

Scientific paper

Connections between longest increasing subsequences in random permutations
and eigenvalues of random matrices with complex entries have been intensely
studied. This note applies properties of random elements of the finite general
linear group to obtain results about the longest increasing subsequence in non-
uniform random permutations.

Affiliated with

Also associated with

No associations

Rating

GL(n,q) and Increasing Subsequences in Nonuniform Random Permutations 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 GL(n,q) and Increasing Subsequences in Nonuniform Random Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GL(n,q) and Increasing Subsequences in Nonuniform Random Permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540789