Application of graph combinatorics to rational identities of type A
| dc.creator | Boussicault, Adrien | |
| dc.creator | Féray, Valentin | |
| dc.date | 2008-11-16 | |
| dc.date | 2009-01-21 | |
| dc.date.accessioned | 2026-07-07T12:31:53Z | |
| dc.date.available | 2026-07-07T12:31:53Z | |
| dc.description | To a word $w$, we associate the rational function $Ψ_w = \prod (x_{w_i} - x_{w_{i+1}})^{-1}$. The main object, introduced by C. Greene to generalize identities linked to Murnaghan-Nakayama rule, is a sum of its images by certain permutations of the variables. The sets of permutations that we consider are the linear extensions of oriented graphs. We explain how to compute this rational function, using the combinatorics of the graph $G$. We also establish a link between an algebraic property of the rational function (the factorization of the numerator) and a combinatorial property of the graph (the existence of a disconnecting chain). | |
| dc.description | This is the complete version of the submitted fpsac paper (2009) | |
| dc.identifier | https://arxiv.org/abs/0811.2562 | |
| dc.identifier | http://arxiv.org/abs/0811.2562 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/216602 | |
| dc.subject | Combinatorics | |
| dc.title | Application of graph combinatorics to rational identities of type A | |
| dc.type | text |