English
Related papers

Related papers: A Rademacher exact type formula for pod$_2(n)$

200 papers

An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an…

Combinatorics · Mathematics 2020-10-22 Adam Gowty , Daniel Horsley

In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…

Combinatorics · Mathematics 2025-10-21 Augustine O. Munagi

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

Number Theory · Mathematics 2025-05-30 Dohoon Choi , Youngmin Lee

Extending the partition function multiplicatively to a function on partitions, we show that it has a unique maximum at an explicitly given partition for any $n\neq 7$. The basis for this is an inequality for the partition function which…

Combinatorics · Mathematics 2014-04-08 Christine Bessenrodt , Ken Ono

Sometimes we need the approximate value of the partition number in a simple and efficient way. There are already several formulae to calculate the partition number p(n). But they are either inconvenient for most people (not majored in math)…

Number Theory · Mathematics 2018-07-10 Wenwei Li

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

Number Theory · Mathematics 2012-07-05 Terence Tao

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

We use Schwinger's proper time method to compute the parity odd contributions to the U(1) current and energy-momentum tensor of an ideal gas of fermions in 2+1 dimensions in the presence of static gauge and gravitational backgrounds. From…

High Energy Physics - Theory · Physics 2014-01-24 Juan L. Mañes , Manuel Valle

We give a complete characterization of the parity of $b_8(n)$, the number of $8$-regular partitions of $n$. Namely, we prove that $b_8(n)$ is odd or even depending on whether or not we have the factorisation $24n+7=p^{4a+1}m^2$, for some…

Number Theory · Mathematics 2022-12-23 Giacomo Cherubini , Pietro Mercuri

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

History and Overview · Mathematics 2017-08-04 Eunice Krinsky , Serban Raianu , Alexander Wittmond

Let $p_2(n)$ denote the number of cubic partitions. In this paper, we shall present two new congruences modulo $11$ for $p_2(n)$. We also provide an elementary alternative proof of a congruence established by Chan. Furthermore, we will…

Number Theory · Mathematics 2017-02-14 Shane Chern , Manosij Ghosh Dastidar

In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…

Number Theory · Mathematics 2018-02-02 Giuseppe Fera , Vittorino Talamini

Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…

Number Theory · Mathematics 2021-10-20 Richard Brent , Carl Pomerance , David Purdum , Jonathan Webster

This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…

Combinatorics · Mathematics 2012-09-28 Douglas Bowman , Alon Regev

Let $b(n)$ denote the number of cubic partition pairs of $n$. We give affirmative answer to a conjecture of Lin, namely, we prove that $$b(49n+37)\equiv 0 \pmod{49}.$$ We also prove two congruences modulo $256$ satisfied by…

Number Theory · Mathematics 2018-08-13 Chiranjit Ray , Rupam Barman

We estimate the sums \[ \sum_{c\leq x} \frac{S(m,n,c,\chi)}{c}, \] where the $S(m,n,c,\chi)$ are Kloosterman sums of half-integral weight on the modular group. Our estimates are uniform in $m$, $n$, and $x$ in analogy with Sarnak and…

Number Theory · Mathematics 2015-11-25 Scott Ahlgren , Nickolas Andersen

We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

Combinatorics · Mathematics 2020-11-20 Damir Yeliussizov

Let $b(n)$ be the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ consists of distinct odd parts, and $\pi_2$ and $\pi_3$ consist of parts divisible by $4$. Utilizing modular forms, Lin obtained the generating…

Number Theory · Mathematics 2026-01-09 Russelle Guadalupe

We prove that for all natural numbers k,n,d with k <= d and every partition lambda of size kn with at most k parts there exists an irreducible GL(d, C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n) (C^d)). This…

Group Theory · Mathematics 2010-12-16 Peter Bürgisser , Matthias Christandl , Christian Ikenmeyer

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

Combinatorics · Mathematics 2007-05-23 Edwin O'Shea