Abstract
Given a (bounded affine) permutation f f , we study the positroid Catalan number C f C_f defined to be the torus-equivariant Euler characteristic of the associated open positroid variety. We introduce a class of repetition-free permutations and show that the corresponding positroid Catalan numbers count Dyck paths avoiding a convex subset of the rectangle. We show that any convex subset appears in this way. Conjecturally, the associated q , t q,t -polynomials coincide with the generalized q , t q,t -Catalan numbers that recently appeared in relation to the shuffle conjecture, flag Hilbert schemes, and Khovanov–Rozansky homology of Coxeter links.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Communications of the American Mathematical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.