2000 character limit reached
Hybrid Proofs of the $q$-Binomial Theorem and other identities
Published 5 Jan 2019 in math.NT | (1901.05329v1)
Abstract: We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the Identity Theorem) to prove the full version. We prove three somewhat unusual summation formulae, and use these to give hybrid proofs of a number of identities due to Ramanujan. Finally, we use these new summation formulae to give new partition interpretations of the Rogers-Ramanujan identities and the Rogers-Selberg identities.
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.