English

Difference operators for partitions and some applications

Combinatorics 2018-01-22 v3

Abstract

Motivated by the Nekrasov-Okounkov formula on hook lengths, the first author conjectured that the Plancherel average of the 2k2k-th power sum of hook lengths of partitions with size nn is always a polynomial of nn for any kNk\in \mathbb{N}. This conjecture was generalized and proved by Stanley (Ramanujan J., 23(1--3): 91--105, 2010). In this paper, inspired by the work of Stanley and Olshanski on the differential poset of Young lattice, we study the properties of two kinds of difference operators DD and DD^- defined on functions of partitions. Even though the calculations for higher orders of DD are extremely complex, we prove that several well-known families of functions of partitions are annihilated by a power of the difference operator DD. As an application, our results lead to several generalizations of classic results on partitions, including the marked hook formula, Stanley Theorem, Okada-Panova hook length formula, and Fujii-Kanno-Moriyama-Okada content formula. We insist that the Okada constants KrK_r arise directly from the computation for a single partition λ\lambda, without the summation ranging over all partitions of size~nn.

Keywords

Cite

@article{arxiv.1508.00772,
  title  = {Difference operators for partitions and some applications},
  author = {Guo-Niu Han and Huan Xiong},
  journal= {arXiv preprint arXiv:1508.00772},
  year   = {2018}
}

Comments

27 pages

R2 v1 2026-06-22T10:26:06.036Z