English
Related papers

Related papers: Distribution of 3-regular and 5-regular partitions

200 papers

Let $(p_n)$ denote the sequence of prime numbers, with $2=p_1<p_2<\ldots$. We demonstrate the existence of an irrational number $\alpha$ having the property that the sequence $(\alpha p_n)$ is not well-distributed modulo $1$.

Number Theory · Mathematics 2024-07-01 J. Champagne , T. H. Lê , Y. -R. Liu , T. D. Wooley

For p = 3 and p = 5, we exhibit a finite nonsolvable extension of the rational numbers which is ramified only at p via explicit computations with Hilbert modular forms.

Number Theory · Mathematics 2014-01-14 Lassina Dembele , Matthew Greenberg , John Voight

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

Combinatorics · Mathematics 2019-09-04 Jacob Sprittulla

In this article I present results from a statistical study of prime numbers that shows a behaviour that is not compatible with the thesis that they are distributed randomly. The analysis is based on studying two arithmetical progressions…

General Mathematics · Mathematics 2018-04-23 Andrea Berdondini

In $1984$, Andrews introduced the family of partition functions $c\phi_k(n)$, which enumerate generalized Frobenius partitions of $n$ with $k$ colors. In $2016$, Gu, Wang, and Xia established several congruences for $c\phi_6(n)$ and…

Combinatorics · Mathematics 2026-04-07 Dandan Chen , Siyu Yin

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

Combinatorics · Mathematics 2024-06-04 Cristina Ballantine , Amanda Welch

We investigate the distribution of the function $\omega(n)$, the number of distinct prime divisors of $n$, in residue classes modulo $q$ for natural numbers $q$ greater than 2. In particular we ask `prime number races' style questions, as…

Number Theory · Mathematics 2018-06-06 Sam Porritt

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Number Theory · Mathematics 2016-02-26 Zhi-Wei Sun

Andrews and Merca [J. Combin. Theory Ser. A 203 (2024), Art. 105849] recently obtained two interesting results on the sum of the parts with the same parity in the partitions of $n$ (the modulo $2$ case), the proof of which relies on…

Combinatorics · Mathematics 2024-06-07 Ji-Cai Liu

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…

Combinatorics · Mathematics 2025-08-26 Mohammed L. Nadji , Manjil P. Saikia , James A. Sellers

Nguyen has shown that on averaging over $a=1,...,q$ the 3-fold divisor function has exponent of distribution 2/3, following \cite {banks}. We follow [2] which leads to stronger bounds.

Number Theory · Mathematics 2024-09-04 Tomos Parry

Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…

Combinatorics · Mathematics 2010-06-29 William Y. C. Chen , Kathy Q. Ji , Albert J. W. Zhu

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

Combinatorics · Mathematics 2026-04-14 George E. Andrews , Aritram Dhar

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

Combinatorics · Mathematics 2012-03-21 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…

Number Theory · Mathematics 2017-10-13 Błażej Żmija

We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.

General Mathematics · Mathematics 2020-12-22 Sumit Kumar Jha

We identify a class of "semi-modular" forms invariant on special subgroups of $GL_2(\mathbb Z)$, which includes classical modular forms together with complementary classes of functions that are also nice in a specific sense. We define an…

Number Theory · Mathematics 2021-12-02 Matthew Just , Robert Schneider

In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…

Combinatorics · Mathematics 2025-01-14 George E. Andrews , Rahul Kumar

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

Combinatorics · Mathematics 2024-07-01 Thomas Y. He , C. S. Huang , H. X. Li , X. Zhang

We study the asymptotic behavior of solid partitions using transition matrix Monte Carlo simulations. If $p_3(n)$ denotes the number of solid partitions of an integer $n$, we show that $\lim_{n\rightarrow\infty} n^{-3/4} \log p_3(n)\sim…

Statistical Mechanics · Physics 2021-06-07 Nicolas Destainville , Suresh Govindarajan