Exact samplers for permutations with fixed LIS length k: O(n log log n) expected time rejection sampler when k=Theta(n), and tilde O(n^3 k^4) RS-based sampler for arbitrary k via determinant oracles on Hankel moment matrices.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
citing papers explorer
-
Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
Exact samplers for permutations with fixed LIS length k: O(n log log n) expected time rejection sampler when k=Theta(n), and tilde O(n^3 k^4) RS-based sampler for arbitrary k via determinant oracles on Hankel moment matrices.
- Recursive Record Filtering and Longest Decreasing Subsequences