How permutations displace points and stretch intervals
Daniel Daly, Petr Vojt\v{e}chovsk\'y

TL;DR
This paper investigates how permutations displace points and stretch intervals, analyzing average displacement, maximal displacement, and the extremal permutations that achieve these maxima, revealing precise formulas and characterizations.
Contribution
It provides exact formulas for maximal displacement measures in permutations and characterizes all permutations that attain these maxima.
Findings
Expected displacement ratio approaches 1/3 as n grows large.
Explicit formulas for maximum average and geometric stretch measures.
Complete characterization of permutations with maximal displacement and stretch.
Abstract
Let be the set of permutations on and . Let be the arithmetic average of . Then , the expected value of approaches as approaches infinity, and is close to for most permutations. We describe all permutations with maximal . Let and be the arithmetic and geometric averages of , and let , be the maxima of and over , respectively. Then when , when , when , and, interestingly, when . We describe all permutations , …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Limits and Structures in Graph Theory
