kostka polynomials
Recently Published Documents


TOTAL DOCUMENTS

32
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

2018 ◽  
Vol 159 ◽  
pp. 107-163 ◽  
Author(s):  
M. Wheeler ◽  
P. Zinn-Justin
Keyword(s):  

2017 ◽  
Vol 108 (3) ◽  
pp. 679-698
Author(s):  
Gwyn Bellamy ◽  
Travis Schedler

2017 ◽  
Vol 39 (3) ◽  
pp. 743-776 ◽  
Author(s):  
Shiyuan LIU ◽  
Toshiaki SHOJI
Keyword(s):  

2012 ◽  
Vol 37 (1) ◽  
pp. 117-138 ◽  
Author(s):  
Jinkui Wan ◽  
Weiqiang Wang
Keyword(s):  

10.37236/18 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Eliana Zoque

Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a single square partition or with several partitions with only one part. The cardinalities of those families of partitions are the Catalan and ballot numbers, respectively. In this paper we present a non-recursive description for those families and prove that the generating function of the size of those partitions is a Kostka number. We also present bijections between those sets of partitions and sets of trees and forests enumerated by the Catalan an ballot numbers, respectively.


2006 ◽  
Vol 113 (7) ◽  
pp. 1435-1461 ◽  
Author(s):  
Lipika Deka ◽  
Anne Schilling
Keyword(s):  

2005 ◽  
Vol 38 (42) ◽  
pp. 9183-9205 ◽  
Author(s):  
Eddy Ardonne ◽  
Rinat Kedem ◽  
Michael Stone

Sign in / Sign up

Export Citation Format

Share Document