Searcharxiv⌕ Search

arXiv subjects

Mircea Merca

Publications and source records attributed to Mircea Merca.

At least 19 recordsLinked to original sources

Residue Sums Modulo Products of Two Distinct Odd Primes

Let $S_m(a)$ denote the sum of the least positive residues in one multiplicative period of $a$ modulo $m$, of length $k$. We study the equality $S_m(a)=mk/2$ for $m=pq$, where $p,q$ are distinct odd primes and $k$ is even. Complementary pairing settles subgroups containing $-1$; the remaining cases depend on their embedding in the two local unit groups. At index four, we exclude mixed cyclic subgroups with biquadratic annihilator and classify every eligible imprimitive quartic kernel using two odd integer moments at its prime conductor. For each fixed conductor, the proportion of admissible second primes giving equality is $1/4$ or $1/2$; full coset balance has proportion $1/4$. For primitive quartic characters, classical triangular character-sum identities yield explicit short-sum criteria, and the relative class-number formula gives an obstruction to a centered coset. At index six, we give structural counts and construct an infinite family modulo $19q$ in which nonzero sextic and quadratic moments cancel. These applications use a standard odd-character expansion, which also recovers the known index-two balance classification and determines the sign of its deviation. A reproducible census for $pq\le10000$ counts $75\,090$ eligible cyclic subgroups and identifies $101$ mixed index-four subgroups whose own sum is centered although some coset sums are not.

math.NT↗

Dyadic Structure of the Two-Block Odd Partition Function and Theta-Weighted Congruences for $pod(n)$

The two-block odd partition function \(a(n)\) is the signed enumeration of partitions into exactly two distinct part sizes, each occurring an odd number of times. By separating the underlying representations according to the \(2\)-adic valuations of the two part sizes, we obtain a signed decomposition, completed by two classical theta-function evaluations, which explains the structural relation \(a(2^km)=a(m)+(2^{k-1}-1)σ(m)\), where \(m\) is odd, \(k\ge1\), and \(σ(m)\) is the sum-of-divisors function. Combined with a previously established arithmetic formula for \(a(n)\), this relation yields congruences along the dyadic progressions \(2^k(4n+3)\), as well as the families \(a\!\left(2^\alpha3^β(12n+11)\right)\equiv0\pmod3\) and \(a\!\left(2^α(18n+15)\right)\equiv0\pmod3\). We also use a factorization of the generating function of \(a(n)\) involving \(\operatorname{pod}(n)\), the number of partitions in which odd parts are distinct and even parts are unrestricted, to establish a uniform reduction modulo every odd prime of the associated auxiliary series. The resulting theta-weighted sums involving \(\operatorname{pod}(n)\) are congruent to \(a(n)\) and therefore admit explicit evaluations involving the sum-of-divisors function and the character divisor sum associated with the nonprincipal Dirichlet character modulo \(4\). As special cases, we obtain infinite families of weighted congruences modulo \(3\), \(5\), and \(13\).

math.NT↗

The two-block odd partition function

We investigate arithmetic and combinatorial properties of the function $a(n)$, which is the signed number of partitions of $n$ into exactly two distinct part sizes, each occurring an odd number of times. We prove that $a(n)\ge 0$ for all $n$, establishing a positivity phenomenon for a signed partition function arising from a double Lambert series. Furthermore, we show that $a(n)$ satisfies nontrivial divisibility properties modulo $3$. The results reveal unexpected arithmetic regularity in a family of partition functions defined by odd multiplicity constraints and restricted support.

math.NT↗

MacMahon-type $q$-series

Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor structures. In particular, we consider the $q$-series \[ V_k(q) = \sum_{1 \le n_1 \le n_2 \le \cdots \le n_k} \frac{q^{\,n_1+n_2+\cdots+n_k}} {(1-q^{n_1})^2(1-q^{n_2})^2\cdots(1-q^{n_k})^2}, \] introduced recently as MacMahon-type generating functions. We further define a new MacMahon-type series \[ W_k(q) = \sum_{1 \le n_1 \le n_2 \le \cdots \le n_k} \frac{q^{\,2(n_1+n_2+\cdots+n_k)-k}} {(1-q^{2n_1-1})^2(1-q^{2n_2-1})^2\cdots(1-q^{2n_k-1})^2}, \] and establish families of identities, generating function relations, and hypergeometric representations for the truncated forms of $V_k(q)$ and $W_k(q)$. Connections with overpartition pairs and bipartitions with distinct odd parts arise naturally in this context.

math.CO↗

From crank to congruences

In this paper, we investigate the arithmetic properties of the difference between the number of partitions of a positive integer $n$ with even crank and those with odd crank, denoted $C(n)=c_e(n)-c_o(n)$. Inspired by Ramanujan's classical congruences for the partition function $p(n)$, we establish a Ramanujan-type congruence for $C(n)$, proving that $C(5n+4) \equiv 0 \pmod{5}$. Further, we study the generating function $\sum\limits_{n=0}^\infty a(n)\, q^n = \frac{(-q; q)^2_\infty}{(q; q)_\infty}$, which arises naturally in this context, and provide multiple combinatorial interpretations for the sequence $a(n)$. We then offer a complete characterization of the values $a(n) \mod 2^m$ for $m = 1, 2, 3, 4$, highlighting their connection to generalized pentagonal numbers. Using computational methods and modular forms, we also derive new identities and congruences, including $a(7n+2) \equiv 0 \pmod{7}$, expanding the scope of partition congruences in arithmetic progressions. These results build upon classical techniques and recent computational advances, revealing deep combinatorial and modular structure within partition functions.

math.NT↗

Do perfect powers repel partition numbers?

In 2013 Zhi-Wei Sun conjectured that $p(n)$ is never a power of an integer when $n>1.$ We confirm this claim in many cases. We also observe that integral powers appear to repel the partition numbers. If $k>1$ and $Δ_k(n)$ is the distance between $p(n)$ and the nearest $k$th power, then for every $d\geq 0$ we conjecture that there are at most finitely many $n$ for which $Δ_k(n)\leq d.$ More precisely, for every $\varepsilon>0,$ we conjecture that $$M_k(d):=\max\{n \ : \ Δ_k(n)\leq d\}=o( d^{\varepsilon}).$$ In $k$-power aspect with $d$ fixed, we also conjecture that if $k$ is sufficiently large, then $$ M_k(d)=\max \left\{ n \ : \ p(n)-1\leq d\right\}. $$ In other words, $1$ generally appears to be the closest $k$th power among the partition numbers.

math.CO↗

Elementary symmetric partitions

Let e_k(x_1,...,x_l) be an elementary symmetric polynomial and let mu = (mu_1,...,mu_l) be an integer partition. Define pre_k(mu) to be the partition whose parts are the summands in the evaluation e_k(mu_1,...,mu_l). The study of such partitions was initiated by Ballantine, Beck, and Merca who showed (among other things) that pre_2 is injective as a map on binary partitions of n. In the present work we derive a host of identities involving the sequences which count the number of parts of a given value in the image of pre_2. These include generating functions, explicit expressions, and formulas for forward differences. We generalize some of these to d-ary partitions and explore connections with color partitions. Our techniques include the use of generating functions and bijections on rooted partitions. We end with a list of conjectures and a direction for future research.

math.CO↗

Partitions and elementary symmetric polynomials -- an experimental approach

Given a partition $λ$, we write $e_j(λ)$ for the $j^{\textrm{th}}$ elementary symmetric polynomial $e_j$ evaluated at the parts of $λ$ and $e_jp_A(n)$ for the sum of $e_j(λ)$ as $λ$ ranges over the set of partitions of $n$ with parts in $A$. For $e_jp_A(n)$, we prove analogs of the classical formula for the partition function, $p(n)=1/n \sum_{k=0}^{n-1}σ_1(n-k)p(k)$, where $σ_1$ is the sum of divisors function. We prove several congruences for $e_2p_4(n)$, the sum of $e_2$ over the set of partitions of $n$ into four parts. Define the function $\textrm{pre}_j(λ)$ to be the multiset of monomials in $e_j(λ)$, which is itself a partition. If $\mathcal A$ is a set of partitions, we define $\textrm{pre}_j(\mathcal A)$ to be the set of partitions $\textrm{pre}_j(λ)$ as $λ$ ranges over $\mathcal A$. If $\mathcal P(n)$ is the set of all partitions of $n$, we conjecture that the number of odd partitions in $\textrm{pre}_2(\mathcal P(n))$ is at least the number of distinct partitions. We prove some results about $\textrm{pre}_2(\mathcal B(n))$, where $\mathcal B(n)$ is the set of binary partitions of $n$. We conclude with conjectures on the log-concavity of functions related to $e_jp(n)$, the sum of $e_j(λ)$ for all $λ\in \mathcal P(n)$.

math.CO↗

The partition function $p(n)$ in terms of the classical Möbius function

In this paper, we investigate decompositions of the partition function $p(n)$ from the additive theory of partitions considering the famous Möbius function $μ(n)$ from multiplicative number theory. Some combinatorial interpretations are given in this context. Our work extends several analogous identities proved recently relating $p(n)$ and Euler's totient function $φ(n)$. Keywords: Lambert series; Möbius function; $q$-series; partition function

math.CO↗

A Partition Identity Related to Stanley's Theorem

In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this context. These surprising new results connect the famous classical totient function from multiplicative number theory to the additive theory of partitions.

math.NT↗

$6$-regular partitions: new combinatorial properties, congruences, and linear inequalities

We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts not congruent to $\pm 2$ modulo $6$, $Q_2(n)$, and investigate connections between $b_6(n)$ and $Q_2(n)$ providing new combinatorial interpretations for these partition functions. In this context, we discover new infinite families of linear inequalities involving Euler's partition function $p(n)$. Infinite families of linear inequalities involving the $6$-regular partition function $b_6(n)$ and the distinct partition function $Q_2(n)$ are proposed as open problems.

math.NT↗

Parity of 3-regular partition numbers and Diophantine equations

Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23 \pmod {24}$, and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p\geqslant 5$. In this paper, we introduce new infinite Ramanujan type congruences modulo $2$ for $b_3(2n)$. They complement naturally the results of Keith-Zanello and Yao and involve primes in $\mathcal P=\{p \text{ prime } : \exists \, j\in \{1,4,8\},\, x, y \in \mathbb Z,\, \gcd(x,y)=1 \text { with } x^2+216y^2=jp\}$ whose Dirichlet density is $1/6$. As a key ingredient in our proof we show that of the number of primitive solutions for $x^2+216y^2=pm$, $p \in \mathcal P$, $p\nmid m$ and $pm\equiv 1\pmod{24}$, is divisible by $8$. Here, the difficulty arises from the fact that $216$ is not idoneal. We also give a conjectural exact formula for the number of solutions for this Diophantine equation. In the second part of the article, we study reversals of Euler-type identities. These are motivated by recent work of the second author on a reversal of Schur's identity which involves $3$-regular partitions weighted by the parity of their length.

math.NT↗

$4$-Regular partitions and the pod function

The partition function $pod(n)$ enumerates the partitions of $n$ wherein odd parts are distinct and even parts are unrestricted. Recently, a number of properties for $pod(n)$ have been established. In this paper, for $k\in\{0,2\}$ we consider the partitions of $n$ into distinct parts not congruent to $k$ modulo $4$ and the $4$-regular partitions of $n$ in order to obtain new properties for $pod(n)$. In this context, we derive two new infinite families of linear inequalities involving the function $pod(n)$ and obtain new identities of Watson type.

math.CO↗

On Ramanujan-type Congruences for Multiplicative Functions

The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we investigate the existence and classification of Ramanujan-type congruences for functions in multiplicative number theory.

math.NT↗

Dyson's crank and unimodal compositions

The crank is a partition statistic requested by Dyson in 1944 in order to combinatorially prove a Ramanujan congruence of Euler's partition function $p(n)$. In this paper, we provide connections between Dyson's crank and unimodal compositions. Somewhat unrelated, we give a combinatorial proof of a new truncated Euler pentagonal number theorem due to Xia and Zhao.

math.CO↗

Infinite product formulae for generating functions for sequences of squares

We state and prove product formulae for several generating functions for sequences $(a_n)_{n\ge0}$ that are defined by the property that $Pa_n+b^2$ is a square, where $P$ and $b$ are given integers. In particular, we prove corresponding conjectures of the second author. We show that, by means of the Jacobi triple product identity, all these generating functions can be reduced to a linear combination of theta function products. The proof of our formulae then consists in simplifying these linear combinations of theta products into single products. We do this in two ways: (1) by using modular function theory, and (2) by applying the Weierstraßaddition formula for theta products.

math.NT↗

Overpartitions and functions from multiplicative number theory

Let $α$ and $β$ be two nonnegative integers such that $β< α$. For an arbitrary sequence $\{a_n\}_{n\geqslant 1}$ of complex numbers, we consider the generalized Lambert series in order to investigate linear combinations of the form $\sum_{k\geqslant 1} S(αk-β,n) a_k$, where $S(k,n)$ is the total number of non-overlined parts equal to $k$ in all the overpartitions of $n$. The general nature of the numbers $a_n$ allows us to provide connections between overpartitions and functions from multiplicative number theory.

math.CO↗