Search arXivSearch

arXiv · 2607.10576

Sign Patterns in a Two Colored Partition Companion series

Abstract

We study two closely related questions arising from the recent work of Andrews and El Bachraoui on the two-color partition series \[ S_1(q)=\sum_{n\ge0}s_1(n)q^n=\sum_{a\ge0}q^a(-q^{a+1};q)_\infty^2 \] and its odd companion, denoted by $T_o(q)$. First, for the eta-normalized companion \[ C(q)=(q;q)_\infty T_o(q)=\sum_{n\ge0}c(n)q^n, \] we prove a strong form of the Andrews--El Bachraoui sign conjecture that $\limsup c(n)=+\infty$ and $\liminf c(n)=-\infty$. Second, we construct an involution using the Franklin-type involution of Chen and Liu to combinatorially explain Andrews--El Bachraoui congruence for $s_1(n)$ modulo 4.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aritram Dhar, Ankush Goswami, Mohit Tripathi. 2026-07-12. Sign Patterns in a Two Colored Partition Companion series. https://arxiv.org/abs/2607.10576

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT