To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The set of integer partitions of n, wherein the parts are either divisible by 4 or congruent to $\pm 1 \pmod {6}$, arose in a natural way in work of Dombos [‘A new grounded partition identity of type $D_4^{(3)}$’, SIGMA22 (2026), Article no. 042]. Denote the function that counts the number of such partitions of n by $\mathit {dp}(n)$. Using elementary generating function manipulations and classical q-series results, we prove several congruences satisfied by $\mathit {dp}(n)$. As an example, we prove that, for all $\alpha \geq 1$ and all $n \geq 0$,
Ballantine et al. [‘Partitions and elementary symmetric polynomials: an experimental approach’, Ramanujan J.66(2) (2025), Article no. 34] proposed two conjectures on the injectivity of a class of maps ${pre}_k$ defined on integer partitions. These maps arise from applying the sequence of elementary symmetric polynomials to integer partitions. We provide an infinite family of examples to disprove the conjecture for $k\ge 3$ and state a modified version of it. Throwing fresh light on this class of maps, we study the inter-relationships between them, deviating from the approaches so far, which study these maps one at a time. While the conjecture for $k=2$ has now been settled, we provide alternate proofs of three subcases. We also discuss lower bounds for the number of partitions of n that are in the image of the map $pre_2$.
We give new analogues of Andrews’ celebrated spt-function identity using basic hypergeometric transformations due to Verma and Jain [‘Transformations between basic hypergeometric series on different bases and identities of Rogers–Ramanujan type’, J. Math. Anal. Appl.76(1) (1980), 230–269].
Assuming the Generalized Riemann Hypothesis, it is known that the least quadratic non-residue modulo a prime p is less than or equal to $(\log p)^2$. In the present article, we establish unconditional results on the distribution of partitions associated with quadratic non-residues in even smaller intervals of size $(\log p)^A$ with $A> 0$, for almost all primes p.
This chapter begins with elementary results concerning Euclidean division and the Euclidean algorithm. We show that the algorithm’s complexity, measured in division steps, has logarithmic growth.
Gently introducing the reader to analytic methods in number theory, we present a proof of the divergence of the Euler series that sums the reciprocals of prime numbers. This not only provides an elegant analytic proof of the infinitude of primes but also offers insight into their distribution.
We then turn to classical arithmetic functions and derive recursive formulas for the partition function, culminating in a complete proof of Euler’s pentagonal number theorem.
This chapter also includes the first of three proofs in this book of Gauss’s theorema fundamentale, the law of quadratic reciprocity, which reveals a remarkable symmetry in the solvability of quadratic congruences modulo two distinct odd primes.
These theoretical foundations underpin practical applications, including the Miller–Rabin primality test – a probabilistic method for identifying prime numbers – and RSA encryption, a cornerstone of modern cryptography that relies on the computational difficulty of factoring large integers.
Let $X_1,\ldots, X_n$ be independent integers distributed uniformly on [M], $M\ge 2$. A partition S of [n] into $\nu$ non-empty subsets $S_1,\ldots, S_{\nu}$ is called perfect if all $\nu$ values $\sum_{j\in S_{\alpha}}X_j$ are equal. For a perfect partition to exist, $\sum_j X_j$ has to be divisible by $\nu$. In 2001, for $\nu=2$, Christian Borgs, Jennifer Chayes, and the author proved that, conditioned on $\sum_j X_j$ being even, with high probability a perfect partition exists if $\kappa\;:\!=\; \lim {{n}/{\log M}}>{{1}/{\log 2}}$, and that with high probability no perfect partition exists if $\kappa<{{1}/{\log 2}}$. Responding to a question by George Varghese, we prove that for $\nu\ge 3$ with high probability no perfect partition exists if $\kappa<{{2}/{\log \nu}}$, which is twice as large as the naive threshold $1/\log 3$ for $\nu=3$. We identify the range of $\kappa$ where the expected number of perfect partitions is exponentially high. We show that for $\kappa> {{2(\nu-1)}/{\log[(1-2\nu^{-2})^{-1}]}}$ the total number of perfect partitions is exponentially high with probability $\gtrsim (1+\nu^2)^{-1}$, i.e. below $1/\nu$, the limiting probability that $\sum_j X_j$ is divisible by $\nu$.
In this article, we generalize Andrews’ partitions separated by parity to overpartitions in two ways. We investigate the generating functions for $16$ overpartition families whose parts are separated by parity, and we prove various q-series identities for these functions. These identities include relations to modular forms, q-hypergeometric series, and mock modular forms.
In 2013, Andrews and Rose proved that $A_k(q)$ and $C_k(q)$ are quasimodular forms of weight $\leq 2k$. Recently, Ono and Singh proved two interesting identities involving $A_k(q)$ and $C_k(q)$ and showed that the generating functions for the three-coloured partition function $p_3(n)$ and the overpartition function $\overline{p}(n)$ have infinitely many closed formulas in terms of MacMahon’s quasimodular forms $A_k(q)$ and $C_k(q)$. In this paper, we introduce the finite forms $A_{k,n}(q)$ and $C_{k,n}(q)$ of MacMahon’s q-series $A_k(q)$ and $C_k(q)$ and prove two identities which generalize Ono–Singh’s identities. We also prove some new identities involving $A_{k,n}(q)$, $C_{k,n}(q)$ and certain infinite products based on two Bailey pairs. Those identities are analogous to Ono–Singh’s identities.
In this paper, we study partitions of totally positive integral elements $ \alpha $ in a real quadratic field $ K $. We prove that for a fixed integer $ m \geq 1 $, an element with $ m $ partition exists in almost all $ K $. We also obtain an upper bound for the norm of $\alpha$ that can be represented as a sum of indecomposables in at most $m$ ways, completely characterize the $\alpha$’s represented in exactly $2$ ways, and subsequently apply this result to complete the search for fields containing an element with $ m $ partitions for $ 1 \leq m \leq 7 $.
We show that the set of Liouville numbers has a rich set-theoretic structure: it can be partitioned in an explicit way into an uncountable collection of subsets, each of which is dense in the real line. Furthermore, each of these partitioning subsets can be similarly partitioned, and the process can be repeated indefinitely.
In this work, we investigate the arithmetic properties of $b_{5^k}(n)$, which counts the partitions of n where no part is divisible by $5^k$. By constructing generating functions for $b_{5^k}(n)$ across specific arithmetic progressions, we establish a set of Ramanujan-type congruences.
Inspired by work of Andrews and Newman [‘Partitions and the minimal excludant’, Ann. Comb.23 (2019), 249–254] on the minimal excludant or ‘mex’ of partitions, we define four new classes of minimal excludants for overpartitions and establish relations to certain functions due to Ramanujan.
We investigate the existence of 4-torsion in the integral cohomology of oriented Grassmannians. We establish bounds on the characteristic rank of oriented Grassmannians and prove some cases of our previous conjecture on the characteristic rank. We also discuss the relation between the characteristic rank and a result of Stong on the height of w1 in the cohomology of Grassmannians. The existence of 4-torsion classes follows from the results on the characteristic rank via Steenrod square considerations. We thus exhibit infinitely many examples of 4-torsion classes for oriented Grassmannians. We also prove bounds on torsion exponents of oriented flag manifolds. The article also discusses consequences of our results for a more general perspective on the relation between the torsion exponent and deficiency for homogeneous spaces.
Recently, Alanazi et al. [‘Refining overpartitions by properties of nonoverlined parts’, Contrib. Discrete Math.17(2) (2022), 96–111] considered overpartitions wherein the nonoverlined parts must be $\ell $-regular, that is, the nonoverlined parts cannot be divisible by the integer $\ell $. In the process, they proved a general parity result for the corresponding enumerating functions. They also proved some specific congruences for the case $\ell =3$. In this paper we use elementary generating function manipulations to significantly extend this set of known congruences for these functions.
Ranks of partitions play an important role in the theory of partitions. They provide combinatorial interpretations for Ramanujan’s famous congruences for partition functions. We establish a family of congruences modulo powers of $5$ for ranks of partitions.
Noting a curious link between Andrews’ even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is twofold. Firstly, we derive results for certain restricted partitions with even parts below odd parts. These include a Franklin-type involution proving a parametrized identity that generalizes Andrews’ bivariate generating function, and two families of Andrews–Beck type congruences. Secondly, we introduce several new subsets of partitions that are stable (i.e. invariant under conjugation) and explore their connections with three third-order mock theta functions $\omega (q)$, $\nu (q)$, and $\psi ^{(3)}(q)$, introduced by Ramanujan and Watson.
In 2019, Andrews and Newman [‘Partitions and the minimal excludant’, Ann. Comb.23(2) (2019), 249–254] introduced the arithmetic function $\sigma \textrm {mex}(n)$, which denotes the sum of minimal excludants over all the partitions of n. Baruah et al. [‘A refinement of a result of Andrews and Newman on the sum of minimal excludants’, Ramanujan J., to appear] showed that the sum of minimal excludants over all the partitions of n is the same as the number of partition pairs of n into distinct parts. They proved three congruences modulo $4$ and $8$ for two functions appearing in this refinement and conjectured two further congruences modulo $8$ and $16$. We confirm these two conjectures by using q-series manipulations and modular forms.
For which infinite cardinals $\kappa $ is there a partition of the real line ${\mathbb R}$ into precisely $\kappa $ Borel sets? Work of Lusin, Souslin, and Hausdorff shows that ${\mathbb R}$ can be partitioned into $\aleph _1$ Borel sets. But other than this, we show that the spectrum of possible sizes of partitions of ${\mathbb R}$ into Borel sets can be fairly arbitrary. For example, given any $A \subseteq \omega $ with $0,1 \in A$, there is a forcing extension in which ${A = \{ n :\, \text {there is a partition of } {{\mathbb R}} \text { into }\aleph _n\text { Borel sets}\}}$. We also look at the corresponding question for partitions of ${\mathbb R}$ into closed sets. We show that, like with partitions into Borel sets, the set of all uncountable $\kappa $ such that there is a partition of ${\mathbb R}$ into precisely $\kappa $ closed sets can be fairly arbitrary.
Let $Q(n)$ denote the number of partitions of n into distinct parts. Merca [‘Ramanujan-type congruences modulo 4 for partitions into distinct parts’, An. Şt. Univ. Ovidius Constanţa30(3) (2022), 185–199] derived some congruences modulo $4$ and $8$ for $Q(n)$ and posed a conjecture on congruences modulo powers of $2$ enjoyed by $Q(n)$. We present an approach which can be used to prove a family of internal congruence relations modulo powers of $2$ concerning $Q(n)$. As an immediate consequence, we not only prove Merca’s conjecture, but also derive many internal congruences modulo powers of $2$ satisfied by $Q(n)$. Moreover, we establish an infinite family of congruence relations modulo $4$ for $Q(n)$.