arXiv (All)
open access
Independence of permutation limits at infinitely many scales
We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite number of scales.
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
- The Erdős similarity problem for null sequences with adjacent ratios bounded below#1248729
- A characterization and closure property of Thorin's class#1536867
- Hausdorff and Packing Measures for $β$-L{ü}roth Infinite Iterated Function Systems#1456899
- Distribution modulo one of linear recurrent sequences#798851
- Distribution modulo one of linear recurrent sequences#797437
Record · ID 1533811
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