Timeline for A certain kind of permutations and transport of Bruhat chains under conjugation
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 21, 2019 at 1:03 | comment | added | Richard Stanley | See oeis.org/A002464. | |
| Apr 19, 2019 at 16:59 | comment | added | Sam Hopkins | okay, yes, this is just an obvious reformulation of your description. I haven't seen these permutations studied specifically. It's an interesting question. | |
| Apr 19, 2019 at 16:58 | comment | added | Christoph Mark | Yes, this is true. I studied those for a longer time now, and if the number of letters grows, there are plenty. That's why I ask if there is something about it in the literature. | |
| Apr 19, 2019 at 16:54 | comment | added | Sam Hopkins | I think for the symmetric group at least, we have $\pi S \pi^{-1}=\varnothing$ if and only if the one line notation of $\pi$ has no two adjacent letters $i$ and $j$ with $|i-j|=1$. E.g., $\pi=13524$ satisfies this. | |
| Apr 19, 2019 at 16:42 | history | asked | Christoph Mark | CC BY-SA 4.0 |