Linked partition ideals, directed graphs and \(q\)-multi-summations (Q2194084): Difference between revisions

In [Bull. Am. Math. Soc. 80, 1033--1052 (1974; Zbl 0301.10016)] \textit{G. E. Andrews} studied systematically Rogers-Ramanujan type identities and developed a general theory in which the concept of linked partition ideals was introduced. As a follow-ups work of \textit{Z. Li} and the author [Discrete Math. 343, No. 7, Article ID 111876, 23 p. (2020; Zbl 1440.05021)], the author investigates the generating function identities of linked partition ideals in the setting of basic graph theory. To this end, he first studies some \(q\)-differential systems, which eventually lead to a factorization problem of a special type of column functional vectors involving \(q\)-multi-summations. With the help of recurrence relation enjoyed by certain \(q\)-multi-summations, the author next provides non-computer-assisted proofs of some Andrews-Gordon type generating function identities. Interestingly, these proofs also have an interesting connection with binary trees. Moreover, he gives illustrations of constructing a linked partition ideal, or more loosely, a set of integer partitions whose generating function corresponds to a given set of special \(q\)-multi-summations. Finally, the author presents some interesting open problems to motivate further investigation.