TL;DR
This paper introduces a new formula and an efficient algorithm to count parabolic double cosets in symmetric groups, enabling computations for large n and confirming an asymptotic conjecture.
Contribution
It derives a novel formula and polynomial-time algorithm for counting parabolic double cosets in symmetric groups, extending previous computational limits.
Findings
Computed p_n for n up to 5000
Proved an asymptotic formula for p_n
Confirmed conjecture by Billey et al.
Abstract
Billey, Konvalinka, Petersen, Solfstra, and Tenner recently presented a method for counting parabolic double cosets in Coxeter groups, and used it to compute , the number of parabolic double cosets in , for . In this paper, we derive a new formula for and an efficient polynomial time algorithm for evaluating this formula. We use these results to compute for and to prove an asymptotic formula for that was conjectured by Billey et al.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
