Refined enumeration of two-rowed set-valued standard tableaux via two-coloured Motzkin paths
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912223074451456 |
|---|---|
| author | Krattenthaler, Christian |
| author_facet | Krattenthaler, Christian |
| contents | We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a bijection with two-coloured Motzkin paths followed by generating function computations and coefficient extraction helped by the Lagrange inversion formula. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_09208 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Refined enumeration of two-rowed set-valued standard tableaux via two-coloured Motzkin paths Krattenthaler, Christian Combinatorics Primary 05A15, Secondary 05E10 33C20 We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a bijection with two-coloured Motzkin paths followed by generating function computations and coefficient extraction helped by the Lagrange inversion formula. |
| title | Refined enumeration of two-rowed set-valued standard tableaux via two-coloured Motzkin paths |
| topic | Combinatorics Primary 05A15, Secondary 05E10 33C20 |
| url | https://arxiv.org/abs/2501.09208 |