Searcharxiv⌕ Search

arXiv subjects

Manjil P. Saikia

Publications and source records attributed to Manjil P. Saikia.

At least 19 recordsLinked to original sources

On the positivity of truncated pentagonal number series and some conjectures of Merca

Let $ν_2(m)$ denote the $2$-adic valuation of a positive integer $m$ and set $N_m=m\bigl(1+ν_2(m)/2\bigr)$. We prove four conjectures of Merca on the nonnegativity of truncated pentagonal number series weighted by the infinite products $\prod_{m\ge 1}(1-q^{2N_m})$ and $\prod_{r\ge 1}\bigl(q^{2^r r};q^{2^{r+1}r}\bigr)_\infty$. Our method is to regard the exponent map $m\mapsto m(ν_2(m)+2)$ as a dynamical system on the positive integers: the factors of the associated quotient link into chains along its forward orbits, and the three orbits seeded at $1$, $4$ and $5$ are pairwise disjoint and telescope to exactly $1/\bigl((1-q)(1-q^4)(1-q^5)\bigr)$. The exponent triple $(1,4,5)$ is admissible in the sense of earlier work by Liu, which yields the desired factorization into two series with nonnegative coefficients. This orbit telescoping technique appears to be a mechanism complementary to the Pólya--Szeg\H o criterion that underlies most existing positivity results of this kind in the literature.

math.NT↗

Internal congruences modulo powers of $2$ for overpartition tuples with odd parts

Let $\overline{\mathrm{OPT}}_m(n)$ denote the number of overpartition $m$-tuples of $n$ into odd parts. We prove that for every odd $m\ge1$ and every $i\ge3$, \[\sum_{n\ge0}\Bigl(\overline{\mathrm{OPT}}_m\bigl(2^in\bigr)-\overline{\mathrm{OPT}}_m\bigl(2^{i-1}n\bigr)\Bigr)q^n \equiv 2^{\,i+1}\sum_{k\ge0}q^{(2k+1)^2} \pmod{2^{\,i+2}} .\] Thus $\overline{\mathrm{OPT}}_m(2^in)\equiv \overline{\mathrm{OPT}}_m(2^{i-1}n)\pmod{2^{i+1}}$, with equality of $2$-adic valuations exactly at the odd squares. The proof is elementary and uniform in $m$: a single family of integer polynomials, given by a three-term recurrence, governs every $U$-operator identity involved, and a divisibility statement supplies one power of $2$ per iteration.

math.NT↗

Generalized Frobenius Partitions Modulo Powers of $2$

Let $cϕ_k(n)$ denote the number of $k$-colored generalized Frobenius partitions of $n$. We prove that, for every $m\geq2$ and every $k\equiv2\pmod{2^m}$, \[ \sum_{n\geq0}cϕ_k(n)q^n\equiv\frac{φ(q)\,(q^2;q^2)_\infty}{(q;q)_\infty^2}\sum_{n\geq0}cϕ_{k/2}(n)q^{2n}\pmod{2^m}, \] where $φ(q)$ is the classical theta function. For $m=2$ this recovers a congruence of Chan, Wang, and Yang. Applied with $k=18$, we determine $cϕ_{18}(2n+1)$ modulo $16$ completely. In particular, we also prove \[ \sum_{n\geq0}cϕ_{18}(6n+1)q^n \equiv4\sum_{r\in\mathbb{Z}}q^{r(3r-1)/2}\pmod{16}, \] which proves the congruences $cϕ_{18}(30n+19)\equiv cϕ_{18}(30n+25)\equiv0\pmod{16}$ recently conjectured by Das, Nath, and Sarma (2026). It also yields further congruences modulo $16$ and a simple modulo-$8$ characterization that recovers and extends a recent congruence of those authors. As a second application we set $k=10$ and determine $cϕ_{10}(2n+1)$ modulo $8$.

math.NT↗

Dyck paths on colored lattices

Fried recently enumerated Dyck paths having equally many black and white cells below them, for the chessboard coloring (Narayana numbers) and the column-alternating coloring (Fuss--Catalan numbers). We prove a generalization here: for the coloring of columns modulo any $c\ge2$, the number of Dyck paths of semilength $n$ whose $c$ residue classes carry equal weight is the Raney number $\Raney_{c+1,r}(m)$, where $n=cm+r-1$.

math.CO↗

Some Comments on Regular Overpartitions modulo $2^k$

For coprime integers $\ell,μ\ge 2$, Alanazi, Munagi, and Saikia (2026) studied $\overline{R}_{\ell,μ}(n)$, the number of overpartitions of $n$ in which no part is divisible by $\ell$ or by $μ$, together with the single-modulus analogue $\overline{R}_{\ell (n)$. We record a simple combinatorial mechanism that determines both functions modulo every power of $2$ in terms of the number of distinct part sizes of the underlying ordinary partition. We also deduce a clean characterization of $\overline{R}_{\ell}(n)$ and $\overline{R}_{\ell,μ}(n)$ modulo $4$ in terms of perfect squares.

math.NT↗

Extending Recent Arithmetic Properties of Overcubic Partition Tuples

In recent years, several mathematicians have looked at a class of partitions called the overcubic partition $k$-tuples, for small values of $k$. They have proved several divisibility results satisfied by these partitions. We continue this study and prove a few infinite family of congruences. Our proofs use elementary techniques from $q$-series and number theory.

math.NT↗

New arithmetic properties for overpartitions where nonoverlined parts are $\ell$-regular

In this paper, we study the partition functions $\overline{R_\ell^\ast}(n)$, which count the number of overpartitions of $n$ where the non-overlined parts are $\ell$-regular for a given $\ell$. Using elementary techniques, as well as the theory of modular forms, we establish several new arithmetic properties, including infinite families of congruences for these functions.

math.NT↗

Arithmetic Properties modulo powers of $2$ and $3$ for Overpartition $k$-Tuples with Odd Parts

Recently, Drema and N. Saikia (2023) and M. P. Saikia, Sarma, and Sellers (2023) proved several congruences modulo powers of $2$ for overpartition triples with odd parts. In this paper, we study further divisibility properties of overpartition $k$-tuples with odd parts using elementary means as well as properties of modular forms. In particular, we prove several congruences modulo multiples of $3$, and an infinite family of congruences modulo powers of $3$; we also prove some cases of a conjecture of Saikia, Sarma, and Sellers.

math.NT↗

Arithmetic Properties of Generalized Cubic and Overcubic Partitions

We prove several congruences satisfied by the generalized cubic and generalized overcubic partition functions, recently introduced by Amdeberhan, Sellers, and Singh. We also prove infinite families of congruences modulo powers of $2$ and modulo $12$ satisfied by the generalized overcubic partitions, as well as some density results that they satisfy. We use both elementary $q$-series techniques as well as the theory of modular forms to prove our results.

math.NT↗

Hook Length Biases in $t$-Core Partitions

Recently, the theory of hook length biases has emerged as a prominent research topic. Led by Ballantine, Burson, Craig, Folsom, and Wen [\textit{Res. Math. Sci.}, 2023], hook length biases are being explored for ordinary partitions, odd versus distinct partitions, self-conjugate versus distinct odd partitions. Lately, Singh and Barman [\textit{J. Number Theory}, 2024] opened the door to hook length biases in $\ell$-regular partitions. In this work, we extend the theory of hook length biases to $t$-core partitions. For example, let $a_{t,k}(n)$ denote the number of hooks of length $k$ in all $t$-core partitions of $n$, then we find that $a_{3,1}(n)\ge a_{3,2}(n) \ge a_{3,4}(n)$ and $a_{4,1}(n)\ge a_{4,3}(n)$ for all $n$. The methods employed in this work are mainly combinatorial.

math.CO↗

Biases in Non-Unitary Partitions

Recently, the concept of parity bias in integer partitions has been studied by several authors. We continue this study here, but for non-unitary partitions (namely, partitions with parts greater than $1$). We prove analogous results for these restricted partitions to those that have been obtained by Kim, Kim, and Lovejoy (2020) and Kim and Kim (2021). We also look at inequalities between two classes of partitions studied by Andrews (2019), where the parts are separated by parity (either all odd parts are smaller than all even parts or vice versa).

math.NT↗

Hook-Length Biases in $t$-regular partitions

Recently, there has been a lot of work on combinatorial inequalities related to hook-lengths in $t$-regular partitions. In this short note, we give a proof using generating functions for a result proved by Singh and Barman (2026) using combinatorial methods. In addition, we give an alternate proof of another result of Singh \& Barman (2024) which yields as a corollary a previously unobserved connection of hook-lengths in $t$-regular partitions with certain distinct parts partitions.

math.CO↗

Arithmetic properties of partition functions introduced by Pushpa and Vasuki

In this short note, we prove several infinite family of congruences for some restricted partitions introduced by Pushpa and Vasuki (2022) (thereby, also proving a conjecture of Dasappa et. al. (2023)). We also prove some isolated congruences which seem to have been missed by earlier authors. Our proof techniques uses both elementary means as well as the theory of modular forms.

math.NT↗

Arithmetic properties of $t$-Schur overpartitions

In a recent work, Nadji and Ahmia introduced the $t$-Schur overpartitions as an overpartition analogue for $t$-Schur partitions, which generalizes the classical Schur's partitions into parts congruent to $1$ or $5$ modulo $6$. We continue the study of this new class of overpartitions and prove several arithmetic results for the cases $t=3,9$ and $t$ being a power of $2$ or a power of $3$.

math.CO↗

Arithmetic properties of $k$-tuple $\ell$-regular partitions

In this paper, we study arithmetic properties satisfied by the $k$-tuple $\ell$-regular partitions. A $k$-tuple of partitions $(ξ_1, ξ_2, \ldots, ξ_k)$ is said to be $\ell$-regular if all the $ξ_i$'s are $\ell$-regular. We study the cases $(\ell, k)=(2,3), (4,3), (\ell, p)$, where $p$ is a prime, and even the general case when both $\ell$ and $k$ are unrestricted. Using elementary means as well as the theory of modular forms we prove several infinite family of congruences and density results for these family of partitions.

math.NT↗

Some Properties of Overpartitions into Nonmultiples of Two Integers

We consider properties of overpartitions that are simultaneously {\ell}-regular and μ-regular, where {\ell} and μ are positive relatively prime integers. We prove a seven-way combinatorial identity related to these overpartitions. We also prove several congruence properties satisfied by this class of partitions (and a further related class) using both generating functions and modular forms with Radu's Algorithm.

math.NT↗

Symmetric Domino Tilings of Aztec Diamonds

In this paper, we give inductive sum formulas to calculate the number of diagonally symmetric, and diagonally \& anti-diagonally symmetric domino tilings of Aztec Diamonds. As a byproduct, we also find such a formula for the unrestricted case as well. Our proofs rely on a new technique for counting the number of perfect matchings of graphs, proposed by the authors recently.

math.CO↗

Combinatorial Proofs of Some Results of Andrews and El Bachraoui

Recently, Andrews and El Bachraoui (2024) proved three very interesting $q$-series identities, from which three simple looking identities involving certain restricted partitions into distinct even parts and $4$-regular partitions follow. In this short note, we give combinatorial proofs of these identities. We also prove the counterpart identities for the restricted partitions into distinct odd parts.

math.CO↗