English
Related papers

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

200 papers

We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified…

Combinatorics · Mathematics 2019-02-21 Kağan Kurşungöz

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

Consider the (almost surely) unique Radon partition of a set of $n$ random Gaussian vectors in $\mathbb R^{n-2}$; choose one of the two parts of this partition uniformly at random, and for $0 \le k \le n$, let $p_k$ denote the probability…

Combinatorics · Mathematics 2025-07-03 Swee Hong Chan , Gil Kalai , Bhargav Narayanan , Natalya Ter-Saakov , Moshe White

Let $\bar{a}_s(n)$ denote the number of partitions of $n$, wherein each odd part is multicolored (atmost $s\ge 1$ colors) and the first appearance of parts may be overlined. In this paper, we establish new families of congruences modulo…

Number Theory · Mathematics 2026-05-21 M. P. Thejitha , S. N. Fathima

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

Computational Geometry · Computer Science 2014-02-04 Adrian Dumitrescu , Sariel Har-Peled , Csaba D. Tóth

We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…

Combinatorics · Mathematics 2016-09-07 Frank K. Hwang , Shmuel Onn , Uriel G. Rothblum

We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation…

High Energy Physics - Theory · Physics 2011-07-19 A. Alexandrov

In this article, we consider the problem of determining formulas for the number of representations of a natural number $n$ by a sum of figurate numbers with certain positive integer coefficients. To achieve this, we prove that the…

Number Theory · Mathematics 2023-02-03 B. Ramakrishnan , Lalit Vaishya

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

Number Theory · Mathematics 2022-11-21 Joerg Bruedern , Trevor D. Wooley

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

Number Theory · Mathematics 2024-01-09 Alfredo Nader

This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…

Number Theory · Mathematics 2016-08-08 Timothy Redmond , Charles Ryavec

For a fixed positive integer $k$, let $C(k,n)$ denote the number of two-color partitions of $n$ with odd smallest part and restrictions on even parts, and let $C_k(q)$ be its generating function. We show that $C(1,n)\equiv d(2n-1)\pmod{4}$…

Number Theory · Mathematics 2026-03-10 George E. Andrews , Mohamed El Bachraoui

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…

Number Theory · Mathematics 2023-02-03 Cristina Ballantine , Mircea Merca

Given integer $n > 0$ and $m > 1$, we call a partition of set $[n] = \{1, \dots, n\}$ {\em $m$-good} if each of the partitioning sets is of size at most $m$ and the sum of numbers in it is a power of $m$, that is, $m^t$ for some $t \geq 0$.…

Combinatorics · Mathematics 2025-08-26 Vladimir Gurvich , Mariya Naumova

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…

Number Theory · Mathematics 2013-04-23 Darren Glass

We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…

Symbolic Computation · Computer Science 2019-04-22 Jean-Guillaume Dumas

We study partitions of totally positive integers in real quadratic fields. We develop an algorithm for computing the number of partitions, prove a result about the parity of the partition function, and characterize the quadratic fields such…

Number Theory · Mathematics 2023-10-17 David Stern , Mikuláš Zindulka

A close connection of reverse plane partitions with an integrable dynamical system called the discrete two-dimensional (2D) Toda molecule is clarified. It is shown that a multiplicative partition function for reverse plane partition of…

Combinatorics · Mathematics 2017-01-25 Shuhei Kamioka

We prove the congruence $\sum_{1 \leq k < \sqrt{N}} \sigma_0 (N - k^2) \equiv 0 \pmod 4$, where $\sigma_0(m)$ denotes the number of positive divisors of $m$, for $N = An + B$ with $(A,B) \in \{ (16,14),$ $(36,30),$ $(72,42),$ $(196,70),$…

In this paper, we prove that the number of unimodal sequences of size $n$ is log-concave. These are coefficients of a mixed false modular form and have a Rademacher-type exact formula due to recent work of the second author and Nazaroglu on…

Number Theory · Mathematics 2023-07-12 Walter Bridges , Kathrin Bringmann