EUVIMEDEUVIMED entdecken
Open Access · CC BY 3.0

Positroid Catalan numbers

Pavel Galashin, Thomas Lam

Communications of the American Mathematical Society · 2024

DOI: 10.1090/cams/33 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Communications of the American Mathematical Society, 2024. Verfasst von Pavel Galashin und 1 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 3.0). Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • National Science Foundation

Zitieren

APA

Galashin, P., & Lam, T. (2024). Positroid Catalan numbers. Communications of the American Mathematical Society. https://doi.org/10.1090/cams/33

Vancouver

Galashin P, Lam T. Positroid Catalan numbers. Communications of the American Mathematical Society. 2024. doi:10.1090/cams/33

BibTeX
@article{Galashin2024,
  author = {Galashin, Pavel and Lam, Thomas},
  title = {Positroid Catalan numbers},
  journal = {Communications of the American Mathematical Society},
  year = {2024},
  doi = {10.1090/cams/33}
}
Kostenlos starten →