Combinatorial proofs for identities related to generalizations of the mock theta functions ω(q) and (q)

Abstract

The two partition functions pω(n) and p(n) were introduced by Andrews, Dixit and Yee, which are related to the third order mock theta functions ω(q) and (q), respectively. Recently, Andrews and Yee analytically studied two identities that connect the refinements of pω(n) and p(n) with the generalized bivariate mock theta functions ω(z;q) and (z;q), respectively. However, they stated these identities cried out for bijective proofs. In this paper, we first define the generalized trivariate mock theta functions ω(y,z;q) and (y,z;q). Then by utilizing odd Ferrers graph, we obtain certain identities concerning to ω(y,z;q) and (y,z;q), which extend some early results of Andrews that are related to ω(z;q) and (z;q). In virtue of the combinatorial interpretations that arise from the identities involving ω(y,z;q) and (y,z;q), we finally present bijective proofs for the two identities of Andrews-Yee.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…