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

Simple item page
dc.creatorFulman, Jason
dc.date2001-09-12
dc.date2001-09-23
dc.date.accessioned2026-07-07T04:43:21Z
dc.date.available2026-07-07T04:43:21Z
dc.descriptionConnections 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.
dc.descriptionResults for longest decreasing subsequence are added
dc.identifierhttps://arxiv.org/abs/math/0109079
dc.identifierhttp://arxiv.org/abs/math/0109079
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62183
dc.subjectCombinatorics
dc.subjectProbability
dc.titleGL(n,q) and Increasing Subsequences in Nonuniform Random Permutations
dc.typetext

Files

Collections

arXiv