REVIEW
The Length of the Longest Common Subsequence of Two Independent Mallows Permutations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The Length of the Longest Common Subsequence of Two Independent Mallows Permutations
read the original abstract
The Mallows measure is a probability measure on $S_n$ where the probability of a permutation $\pi$ is proportional to $q^{l(\pi)}$ with $q > 0$ being a parameter and $l(\pi)$ the number of inversions in $\pi$. We prove a weak law of large numbers for the length of the longest common subsequences of two independent permutations drawn from the Mallows measure, when $q$ is a function of $n$ and $n(1-q)$ has limit in $\mathbb{R}$ as $n \to \infty$.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.