Linked partition ideals, directed graphs and \(q\)-multi-summations
The electronic journal of combinatorics, Tome 27 (2020) no. 3
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl DOI arXiv
In this paper, we start by considering generating function identities for linked partition ideals in the setting of basic graph theory. Then our attention is turned to $q$-difference systems, which eventually lead to a factorization problem of a special type of column functional vectors involving $q$-multi-summations. Using a recurrence relation satisfied by certain $q$-multi-summations, we are able to provide non-computer-assisted proofs of some Andrews--Gordon type generating function identities. These proofs also have an interesting connection with binary trees. Further, we give 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.
DOI :
10.37236/9446
Classification :
11P84, 05A17, 05C05, 05C20, 33D70
Mots-clés : \(q\)-multi-summations, linked partition ideals, \(q\)-differential systems
Mots-clés : \(q\)-multi-summations, linked partition ideals, \(q\)-differential systems
Affiliations des auteurs :
Shane Chern  1
Shane Chern. Linked partition ideals, directed graphs and \(q\)-multi-summations. The electronic journal of combinatorics, Tome 27 (2020) no. 3. doi: 10.37236/9446
@article{10_37236_9446,
author = {Shane Chern},
title = {Linked partition ideals, directed graphs and \(q\)-multi-summations},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {3},
doi = {10.37236/9446},
zbl = {1452.11126},
url = {http://geodesic.mathdoc.fr/articles/10.37236/9446/}
}
Cité par Sources :