Searcharxiv⌕ Search

arXiv · 2610.25380

The Corners of Ramanujan: Partial- and False-Theta Companions to Third-Order Mock Theta Functions

Abstract

Most of the traditional third-order mock theta functions occur naturally as specialized values of partition-rank generating functions. The same finite rank kernels also occur in the ordinary and odd unimodal-rank series studied previously in the literature. We organize a parallel collection of corner series by retaining these kernels and replacing their quadratic core weights by linear peak weights. Their root-of-unity specializations are governed by partial and false theta identities recorded in Ramanujan's Lost Notebook; in one exceptional case the corner companion is itself a mock theta function. The classical rank series and Ramanujan identities are used as inputs. Our new results include exact two- and three-color partition identities with sparse theta discrepancies and an oriented three-dimensional corner with a distinct tower. In both color cases, positive decompositions separate the colored companion into copies of the relevant odd-corner series and a corresponding decorated even-corner series. Thus both sparse discrepancies become signed differences between natural corner families. Burson's boxed modular involution provides a common rank-refined model for the two corrections, whose surviving fixed points produce the exceptional quadratic sequences. For the side rank of the three-dimensional corners we obtain an exact formula at $z=-1$, a strict parity bias, quartic and cubic root-of-unity rank-difference identities, and exact equidistribution modulo $3$ on the progression $6n+5$. The cubic identity also gives exact congruence formulas on the progressions $6n+2$ and $6n+3$. We further classify the associated binary triangular support modulo every integer and derive general congruence families.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

George E. Andrews, Mohamed El Bachraoui. 2026-10-18. The Corners of Ramanujan: Partial- and False-Theta Companions to Third-Order Mock Theta Functions. https://arxiv.org/abs/2610.25380

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

KEEP EXPLORING

Related papers

Transience of walks in the countable complete digraph with complex edge weights

We extend a fragment of the symbolic method in enumerative combinatorics by allowing coefficients in generating functions to be defined by infinite series and generalize Pólya's theorem on random walks. Pólya's theorem determines limits of the probabilities that walks in the grid graph on $\mathbb{Z}^d$, starting at the origin $\overline{0}$, visit the given vertex $\overline{v}$. We generalize the grid graph to the countable complete directed graph $\vec{K}_{\mathbb{N}}$ on the vertices $\mathbb{N}=\{1,2,\dots\}$ and weight its edges by complex numbers. We obtain 16 generalizations of Pólya's theorem. Our approach, in fact, generalizes Markov chains on $\mathbb{N}$ starting at $1$.

math.CO↗

Integral quasi-strongly regular Cayley graphs

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $Γ_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include a sufficient condition for $Γ_H(G)$ to be integral and an explicit computation of its entire spectrum when $H$ is normal, revealing that the spectrum in this case depends only on $|G|$ and the index $[G:H]$.

math.CO↗

Efficient total facial coloring of combinatorial maps

Let $1<k\in\mathbb{Z}$. A total coloring of a connected simple regular graph $G$ via color set $]k]_0=\{0,1,\ldots, k\}$ is efficient if each color yields an efficient dominating set, where efficient domination applies to each color class in $V(G)$. An efficient total coloring of $G$ via $[k]_0$ extends to an efficient total facial coloring $c$ of a map $M(G)$ of $G$ if it assigns a vertex-and-edge $k$-color set to the boundary cycle of each face, with the consequently missing color assigned to the face itself, so that the two adjacent faces along each edge are assigned different colors. Focus is set upon planar and toroidal maps. Modifications of $c$ are also treated by removing a perfect dominating set or a 1-factor from $G$.

math.CO↗