arXiv (All)
open access
The longest increasing subsequences of Luce permutations and permutons
We investigate the longest increasing subsequences (LIS) of random permutations distributed under the Luce model with weights $θ_1^{(n)} \ge \ldots \ge θ_n^{(n)}$. Our first main result provides a general formula for the growth rate of the LIS. For example, we get that the LIS of Luce permutations w
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Shuffle-compatible permutation statistics II: the exterior peak set#820104
- Caged subsequences in permutations#793843
- Caged subsequences in permutations#789836
- Permutations, Pattern Covers, Posets and Positivity: Part I: Patterns and Posets#1414451
- Distribution of the inversion statistic on run-sorted permutations#1076330
Record · ID 1423174
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive