Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 94 tok/s
Gemini 2.5 Pro 57 tok/s Pro
GPT-5 Medium 28 tok/s
GPT-5 High 38 tok/s Pro
GPT-4o 100 tok/s
GPT OSS 120B 461 tok/s Pro
Kimi K2 208 tok/s Pro
2000 character limit reached

How permutations displace points and stretch intervals (1509.05649v1)

Published 18 Sep 2015 in math.CO

Abstract: Let $S_n$ be the set of permutations on ${1,\,\dots,\,n}$ and $\pi\in S_n$. Let $\mathrm{d}(\pi)$ be the arithmetic average of ${|i-\pi(i)|;\;1\le i\le n}$. Then $\mathrm{d}(\pi)/n\in[0,\,1/2]$, the expected value of $\mathrm{d}(\pi)/n$ approaches $1/3$ as $n$ approaches infinity, and $\mathrm{d}(\pi)/n$ is close to $1/3$ for most permutations. We describe all permutations $\pi$ with maximal $\mathrm{d}(\pi)$. Let $\mathrm{s}+(\pi)$ and $\mathrm{s}*(\pi)$ be the arithmetic and geometric averages of ${|\pi(i)-\pi(i+1)|;\;1\le i<n\}$, and let $M^+$, $M^*$ be the maxima of $\mathrm{s}^+$ and $\mathrm{s}^*$ over $S_n$, respectively. Then $M^+=(2m^2-1)/(2m-1)$ when $n=2m$, $M^+ = (2m^2+2m-1)/(2m)$ when $n=2m+1$, $M^* = (m^m(m+1)^{m-1})^{1/(n-1)}$ when $n=2m$, and, interestingly, $M^* = (m^m(m+1)(m+2)^{m-1})^{1/(n-1)}$ when $n=2m+1\>1$. We describe all permutations $\pi$, $\sigma$ with maximal $\mathrm{s}+(\pi)$ and $\mathrm{s}*(\sigma)$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube