Timeline for Probability that k randomly drawn permutations can be arranged to compose to the identity
Current License: CC BY-SA 4.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 6, 2021 at 10:31 | comment | added | Kasper Andersen | I'm not sure if there is a closed form answer. One natural step would be to compute $p_{n,4}$ which would involve counting solutions to equations in $\Sigma_n$ like $xyz=xzy$ (which is easy) or $xyz=zxy$ (which looks hard...). | |
Jul 6, 2021 at 4:47 | vote | accept | Nate River | ||
Jul 5, 2021 at 21:28 | comment | added | Nate River | Impressive analysis! Do you think there is a chance for a “closed form” answer? Say, in terms of the partition function and other known combinatorial objects. Or are asymptotics maybe the best one can hope for? | |
Jul 5, 2021 at 20:19 | history | answered | Kasper Andersen | CC BY-SA 4.0 |