2000 character limit reached
A proof of conjectured partition identities of Nandi
Published 28 Oct 2019 in math.CO, math.NT, math.QA, and math.RT | (1910.12461v2)
Abstract: We generalize the theory of linked partition ideals due to Andrews using finite automata in formal language theory and apply it to prove three Rogers--Ramanujan type identities of modulo 14 that were posed by Nandi through vertex operator theoretic construction of the level 4 standard modules of the affine Lie algebra $A{(2)}_{2}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.