English
Related papers

Related papers: Dissecting the Stanley Partition Function

200 papers

We give an overpartition analogue of Bressoud's combinatorial generalization of the G\"ollnitz-Gordon theorem for even moduli in general case. Let $\widetilde{O}_{k,i}(n)$ be the number of overpartitions of $n$ whose parts satisfy certain…

Combinatorics · Mathematics 2017-03-01 Thomas Y. He , Allison Y. F. Wang , Alice X. H. Zhao

We study the properties of the product, which runs over the primes, $$\mathfrak{p}_n = \prod_{s_p(n) \, \geq \, p} p \quad (n \geq 1),$$ where $s_p(n)$ denotes the sum of the base-$p$ digits of $n$. One important property is the fact that…

Number Theory · Mathematics 2017-10-16 Bernd C. Kellner

The partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…

Number Theory · Mathematics 2011-09-23 Donald M. Davis

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…

Number Theory · Mathematics 2025-05-27 Tewodros Amdeberhan , Mircea Merca

The BG-rank BG($\pi$) of an integer partition $\pi$ is defined as $$\text{BG}(\pi) := i-j$$ where $i$ is the number of odd-indexed odd parts and $j$ is the number of even-indexed odd parts of $\pi$. In a recent work, Fu and Tang ask for a…

Combinatorics · Mathematics 2024-09-12 Aritram Dhar , Avi Mukhopadhyay

We consider partitions $p_{w}(n)$ of a positive integer $n$ arising from the generating functions \[ \sum_{n=1}^\infty p_{w}(n) z^n = \prod_{m \in \mathbb{N}} (1-z^m)^{-w(m)}, \] where the weights $w(m)$ are M\"{o}bius convolutions. We…

Number Theory · Mathematics 2026-03-04 Debmalya Basak , Nicolas Robles , Alexandru Zaharescu

Let $\mathbb{P}$ denote the set of primes and $\mathcal{N}\subset \mathbb{N}$ be a set with arbitrary weights attached to its elements. Set $\mathfrak{p}_{\mathcal{N}}(n)$ to be the restricted partition function which counts partitions of…

Number Theory · Mathematics 2023-11-20 Madhuparna Das , Nicolas Robles , Alexandru Zaharescu , Dirk Zeindler

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

Number Theory · Mathematics 2023-01-09 Ernie Croot , Hamed Mousavi , Maxie Schmidt

In this paper, we consider various theorems of P.A. MacMahon and M.V. Subbarao. For a non-negative integer $n$, MacMahon proved that the number of partitions of $n$ wherein parts have multiplicity greater than 1 is equal to the number of…

Combinatorics · Mathematics 2022-01-20 Darlison Nyirenda , Beaullah Mugwangwavari

We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these…

Number Theory · Mathematics 2019-02-20 Fredrik Johansson

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

Combinatorics · Mathematics 2023-03-17 Philippe Nadeau , Vasu Tewari

Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $k\geq2$. This enables us to extend the $k$-colored partition function multiplicatively to a…

Combinatorics · Mathematics 2017-12-21 Shane Chern , Shishuo Fu , Dazhao Tang

For integers $0 < r \leq t$, let the function $D_{r,t}(n)$ denote the number of parts among all partitions of $n$ into distinct parts that are congruent to $r$ modulo $t$. We prove the asymptotic formula $$D_{r,t}(n) \sim \dfrac{3^{\frac…

Number Theory · Mathematics 2022-07-25 William Craig

Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…

Combinatorics · Mathematics 2013-07-09 Godofredo Iommi Amunategui

Ramanujan's congruence $p(5k+4) \equiv 0 \pmod 5$ led Dyson \cite{dyson} to conjecture the existence of a measure "rank" such that $p(5k+4)$ partitions of $5k+4$ could be divided into sub-classes with equal cardinality to give a direct…

Number Theory · Mathematics 2016-05-20 Rupam Barman , Archit Pal Singh Sachdeva

A hyperbinary partition of the nonnegative integer n is a partition where every part is a power of 2 and every part appears at most twice. We give three applications of the length generating function for such partitions, denoted by h_q(n).…

Combinatorics · Mathematics 2026-03-04 Thomas McConville , James Propp , Bruce E. Sagan

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

Number Theory · Mathematics 2022-12-06 Scott Ahlgren , Olivia Beckwith , Martin Raum

We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…

Combinatorics · Mathematics 2007-12-12 Anisse Kasraoui , Jiang Zeng

For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. Motivated by some recent conjectures of Keith and Zanello, we establish infinite families of congruences modulo $2$…

Number Theory · Mathematics 2022-09-07 Rupam Barman , Ajit Singh , Gurinder Singh

Let $\Sym{n}$ denote the set of all permutations on $n$ labels. Let $c:[0, 1]^2\to [0, \infty)$ be a twice continuously differentiable function. A subfamily of the Mallows model is the Gibbs probability measures on $\Sym{n}$ such that…

Probability · Mathematics 2026-05-06 Raghavendra Tripathi