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

2001/09/12 by Jason Fulman, Fulman, Jason · 1 citation
Mathematics · #Advanced Algebra and Geometry #Advanced Combinatorial Mathematics #Combinatorics #Combinatorics (math.CO) #Discrete mathematics #Eigenvalues and eigenvectors #FOS: Mathematics #Longest common subsequence problem #Longest increasing subsequence #Mathematical analysis #Mathematics #Physics #Probability (math.PR) #Random Matrices and Applications #Random matrix #Random permutation #Subsequence #Symmetric group #math.CO #math.PR

paper · pdf · doi:10.48550/arxiv.math/0109079

published in arXiv (Cornell University) (Cornell University) · Results for longest decreasing subsequence are added

openalex publication_date 2001/09/12 · arxiv created 2001/09/23 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

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.

Cited by

• Splitting phenomenon in the Sathe-Selberg theorem, mod-Poisson convergence with auxiliary randomisation and universality of the Gamma factor

Related

• Asymptotics of the Longest Increasing Subsequence in Random Permutations
• Longest increasing subsequences of random colored permutations
• Increasing Subsequences and Kronecker Coefficients
• Increasing and Decreasing Subsequences of Permutations and Their Variants
• On the longest increasing subsequence and number of cycles of butterfly permutations