On a problem of George Andrews concerning partitions with even parts below odd parts

被引:5
作者
Chern, Shane [1 ]
机构
[1] Penn State Univ, Dept Math, University Pk, PA 16802 USA
关键词
Partition; Generating function; Combinatorial proof;
D O I
10.1007/s13370-019-00676-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Recently, George Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this note, we provide a combinatorial proof of a generating function identity related to such partitions. This answers a problem of Andrews.
引用
收藏
页码:691 / 695
页数:5
相关论文
共 3 条
[1]   Integer Partitions with Even Parts Below Odd Parts and the Mock Theta Functions [J].
Andrews, George E. .
ANNALS OF COMBINATORICS, 2018, 22 (03) :433-445
[2]  
Gasper G., 2004, ENCY MATH ITS APPL, Vsecond
[3]   COMBINATORIAL PROOFS OF CERTAIN IDENTITIES INVOLVING PARTIAL THETA FUNCTIONS [J].
Kim, Byungchan .
INTERNATIONAL JOURNAL OF NUMBER THEORY, 2010, 6 (02) :449-460