Timeline for Permutations with bounded displacement on a circle
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2020 at 7:07 | comment | added | Martin Rubey | It would be great if you could add this to findstat.org. (I'm on a cellphone right now) here is code: def statistic(pi): n=len(pi) return max(min((e-1-i)%n,(i-e+1)%n) for i,e in enumeate(pi)) | |
| Jul 20, 2020 at 22:32 | comment | added | Richard Stanley | Let $f_k(n)$ be the number of such permutations. By the technique used to prove Proposition 4.7.10 of Enumerative Combinatorics, vol. 1, second ed., if we interpret $f_k(n)$ suitably for small $n$ then $\sum_{n\geq 0}f_k(n)x^n=-xQ_k'(x)/Q_k(x)$ for some polynomial $Q_k(x)$. | |
| S Jul 20, 2020 at 21:25 | history | edited | lemon314 | CC BY-SA 4.0 |
added 47 characters in body
|
| Jul 20, 2020 at 21:23 | comment | added | Ville Salo | Given the last paragraph, arxiv.org/abs/1301.4736 might be related. | |
| Jul 20, 2020 at 20:35 | review | Suggested edits | |||
| S Jul 20, 2020 at 21:25 | |||||
| Jul 20, 2020 at 20:06 | history | asked | lemon314 | CC BY-SA 4.0 |