Linked partition ideals, directed graphs and q-multi-summations

From MaRDI portal
Publication:2194084

DOI10.37236/9446zbMATH Open1452.11126arXiv1907.06363OpenAlexW3083178079MaRDI QIDQ2194084FDOQ2194084


Authors: Shane Chern Edit this on Wikidata


Publication date: 25 August 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Finding an Andrews--Gordon type generating function identity for a linked partition ideal is difficult in most cases. In this paper, we will handle this problem in the setting of graph theory. With the generating function of directed graphs with an ``empty vertex, we then turn our attention to a q-difference system. This q-difference system eventually yields a factorization problem of a special type of column functional vectors involving q-multi-summations. Finally, 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.


Full work available at URL: https://arxiv.org/abs/1907.06363




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: Linked partition ideals, directed graphs and \(q\)-multi-summations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194084)