Application of graph combinatorics to rational identities of type A

Details Application of graph combinatorics to rational identities of type A Application of graph combinatorics to rational identities of type A

2008-11-16

arxiv.org/abs/0811.2562v2

Mathematics

Combinatorics

This is the complete version of the submitted fpsac paper (2009)

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Application of graph combinatorics to rational identities of type A does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Application of graph combinatorics to rational identities of type A, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Application of graph combinatorics to rational identities of type A will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330992