2016
DOI: 10.1007/s11139-016-9807-z
|View full text |Cite
|
Sign up to set email alerts
|

Difference operators for partitions under the Littlewood decomposition

Abstract: Abstract. The concept of t-difference operator for functions of partitions is introduced to prove a generalization of Stanley's theorem on polynomiality of Plancherel averages of symmetric functions related to contents and hook lengths. Our extension uses a generalization of the notion of Plancherel measure, based on walks in the Young lattice with steps given by the addition of t-hooks. It is well-known that the hook lengths of multiples of t can be characterized by the Littlewood decomposition. Our study giv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
5

Relationship

4
1

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 25 publications
(51 reference statements)
0
8
0
Order By: Relevance
“…The first author conjectured [4] that P (n) = 1 n! |ν|=n f 2 is always a polynomial in n for all k ∈ N, which was generalized and proved by Stanley [16], and later generalized in [7] (see also [2,5,6,8,10,11,12,13]).…”
Section: Introductionmentioning
confidence: 82%
“…The first author conjectured [4] that P (n) = 1 n! |ν|=n f 2 is always a polynomial in n for all k ∈ N, which was generalized and proved by Stanley [16], and later generalized in [7] (see also [2,5,6,8,10,11,12,13]).…”
Section: Introductionmentioning
confidence: 82%
“…For each box in the Young diagram of the partition λ, let h and c be its hook length and content respectively (see [18,26]). In a preparing paper, by applying results from the study of difference operators on functions of partitions [7,11,12], we will establish the following two explicit formulas with very complicated proofs for the average weights related to hook lengths and contents: (c 2 − j 2 ) = (2r)! (r + 1)!…”
Section: Remarks and Discussionmentioning
confidence: 99%
“…To prove Lemma 4.4, we recall some results on the multisets of hook lengths and contents, obtained in [3]. Suppose that a given t-core partition µ has 01-sequence w(µ) = (a µ,j ) j∈Z .…”
Section: µ-Admissible Functions Of Doubled Distinct Partitionsmentioning
confidence: 99%
“…Suppose that a given t-core partition µ has 01-sequence w(µ) = (a µ,j ) j∈Z . For 0 ≤ i ≤ t − 1 we define [3] b i := b i (µ) = min{j ∈ Z : j ≡ i(mod t), a µ,j = 1}. ).…”
Section: µ-Admissible Functions Of Doubled Distinct Partitionsmentioning
confidence: 99%
See 1 more Smart Citation