On the longest common subsequence of conjugation invariant random permutations

DOI10.37236/8669zbMath1468.60016arXiv1904.00725OpenAlexW3094398789MaRDI QIDQ2205121

Mohamed Slim Kammoun

Publication date: 20 October 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.00725

zbMATH Keywords

permutationconjugation invariantcommon sub-sequence

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random matrices (probabilistic aspects) (60B20) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (2)

Universality for random permutations and some other groups ⋮ Statistical enumeration of groups by double cosets

Uses Software

• DPPy

Cites Work

• Twins in words and long common subsequences in permutations
• An extension of Schensted's theorem
• A variational problem for random Young tableaux
• Transition probabilities for continual Young diagrams and the Markov moment problem
• A note on the expected length of the longest common subsequences of two i.i.d. random permutations
• Monotonous subsequences and the descent process of invariant random permutations
• Longest Increasing and Decreasing Subsequences
• On the distribution of the length of the longest increasing subsequence of random permutations
• Fluctuations of Interlacing Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the longest common subsequence of conjugation invariant random permutations