A three shuffle case of the compositional parking function conjecture

J. Comb. Theory, Ser. A, Volume 123, Issue 1, 2014, Pages 202-238.

被引用4|引用|浏览2|来源
EI
关键词
shuffle resultcompositional parking function conjectureshuffle caseshuffle parking function conjectureshuffle conjecture更多(9+)

摘要

We prove here that the polynomial q,t-enumerates, by the statistics dinv and area, the parking functions whose supporting Dyck path touches the main diagonal according to the composition p@?a+b+c and has a reading word which is a shuffle of one decreasing word and two increasing words of respective sizes a, b, c. Here C"p1 is a rescaled H...更多

代码

数据

您的评分 :
0

 

标签
评论