The Ulam-Hammersley problem for multiset permutations

We obtain the asymptotic behaviour of the longest increasing/non-decreasing subsequences in a random uniform multiset permutation in which each element in {1, . . ., n} occurs k times, where k may depend on n.This generalizes the famous Ulam-Hammersley problem of the case k = 1.The proof relies on poissonization and on a careful non-asymptotic analysis of variants of the Hammersley-Aldous-Diaconis particle system.

Paper

Similar papers

© 2026 NYSGPT2525 LLC