Search arXivSearch

arXiv · 1802.00959

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frank Z. K. Li, Jane Y. X. Yang. 2018-08-10. Combinatorial proofs for identities related to generalizations of the mock theta functions $ω(q)$ and $ν(q)$. https://doi.org/10.1007/s11139-018-0094-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO