# Application of graph combinatorics to rational identities of type $A^\ast$

Abstract : To a word $w$, we associate the rational function $\Psi_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).
Keywords :
Document type :
Conference papers
Domain :

Cited literature [8 references]

https://hal.inria.fr/hal-01185414
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 11:08:32 AM
Last modification on : Saturday, January 15, 2022 - 3:58:17 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:46:37 AM

### File

dmAK0119.pdf
Publisher files allowed on an open archive

### Citation

Adrien Boussicault, Valentin Féray. Application of graph combinatorics to rational identities of type $A^\ast$. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.229-240, ⟨10.46298/dmtcs.2722⟩. ⟨hal-01185414⟩

Record views