arXiv (All)
open access
Permutations from ranking independent random variables
Let $X_1,\ldots,X_n$ be almost surely distinct independent real-valued random variables. Let $σ$ be the random permutation of $\{1,\ldots,n\}$ such that $X_{σ(1)}<X_{σ(2)}<\cdots< X_{σ(n)}$. We show that the set of laws of $σ$, as the laws of $X_1,\ldots,X_n$ vary, has semialgebraic dimension \[
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
- Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons#1131351
- Variance Bounds for Minimum Perfect Matching Problem by Random Walk on Multinomial Distribution#1324938
- A Finite-Entropy Criterion for the Entropic Conditional Central Limit Theorem#799769
- Multiplicative comparisons of Rényi entropies for weighted Bernoulli sums#821562
- Sharp Normalized Covariance Bounds and Constant-Stretch Correlated Sampling on the Hypersimplex#986299
Record · ID 1249175
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