Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.14609 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913902870134784 |
|---|---|
| author | Estupiñán-Salamanca, Santiago Pechenik, Oliver |
| author_facet | Estupiñán-Salamanca, Santiago Pechenik, Oliver |
| contents | We give a new Littlewood-Richardson rule for the Schubert structure coefficients of isotropic Grassmannians, equivalently for the multiplication of $P$-Schur functions. Serrano (2010) previously gave a formula in terms of classes in his shifted plactic monoid. However, this formula is challenging to use because of the difficulty of characterizing shifted plactic classes. We give the first algebraic proof of this formula. We then use it to obtain a new rule that is easy to implement. Our rule is based on identifying a subtle analogue of Yamanouchi tableaux, which we characterize. We show that for some families of structure coefficients, our rule leads to an algorithm with exponentially better time complexity than the original rule of Stembridge (1989). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_14609 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Constructed tableaux and a new shifted Littlewood-Richardson rule Estupiñán-Salamanca, Santiago Pechenik, Oliver Combinatorics Algebraic Geometry We give a new Littlewood-Richardson rule for the Schubert structure coefficients of isotropic Grassmannians, equivalently for the multiplication of $P$-Schur functions. Serrano (2010) previously gave a formula in terms of classes in his shifted plactic monoid. However, this formula is challenging to use because of the difficulty of characterizing shifted plactic classes. We give the first algebraic proof of this formula. We then use it to obtain a new rule that is easy to implement. Our rule is based on identifying a subtle analogue of Yamanouchi tableaux, which we characterize. We show that for some families of structure coefficients, our rule leads to an algorithm with exponentially better time complexity than the original rule of Stembridge (1989). |
| title | Constructed tableaux and a new shifted Littlewood-Richardson rule |
| topic | Combinatorics Algebraic Geometry |
| url | https://arxiv.org/abs/2503.14609 |