An identity in the theory of partitions (Q1971618): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Gerald L. Alexanderson / rank | |||
Property / reviewed by | |||
Property / reviewed by: Gerald L. Alexanderson / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1990048287 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/9903020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some combinatorial conjectures for Jack polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some combinatorial conjectures for shifted Jack polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3947818 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A bijective proof of Lassalle's partition identity / rank | |||
Normal rank |
Latest revision as of 14:57, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An identity in the theory of partitions |
scientific article |
Statements
An identity in the theory of partitions (English)
0 references
8 November 2000
0 references
The author conjectured in 1998 [cf. Ann. Comb. 2, No. 2, 145-163 (1998; Zbl 0933.33014)] an elementary partition identity encountered in the study of shifted Jack polynomials, a special case of which was proved by R. Simion. Let \(\mu\) be an integer partition of length \(l(\mu)\), \(m_i(\mu)\) the number of parts equal to \(i\), \[ z_\mu= \prod_{i\geq 1} i^{m_i(\mu)} m_i(\mu)!, \] \((a)_n= a(a+ 1)\cdots (a+ n-1)\), and \(\left\langle\begin{smallmatrix} n\\ r\end{smallmatrix}\right\rangle\) the number of ways of choosing \(r\) different cells from the diagram of the partition \(\mu\) taking at least one cell from each row. In this paper the author proves this identity, one version of which is \[ \begin{multlined}\sum_{|\mu|= n} \Biggl(\Biggl\langle\begin{matrix} \mu\\ r\end{matrix}\Biggr\rangle/ z_\mu\Biggr) X^{l(\mu)- 1}\Biggl(\sum^{l(\mu)}_{i= 1} (\mu_i)_s\Biggr)=\\ (s-1)!\begin{pmatrix} n+s-1\\ n-r\end{pmatrix} \Biggl[\begin{pmatrix} X+ r+ s-1\\ r\end{pmatrix}- \begin{pmatrix} X+ r-1\\ r\end{pmatrix}\Biggr].\end{multlined} \] The proof uses generating functions.
0 references
partition identity
0 references
integer partition
0 references