Related papers: Finite Differences of the Logarithm of the Partiti…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

To prove by probabilistic methods that every $(n-1)$-dimensional section of the unit cube in $R^n$ has volume at most $\sqrt 2$, K. Ball made essential use of the inequality $$ \frac{1}{\pi}\int_{-\infty}^{\infty} \left(\frac{\sin^2…

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $\lambda(k)$ at a…

For a real-valued non-negative and log-concave function we introduce a notion of difference function; the difference function represents a functional analog on the difference body of a convex body. We prove a sharp inequality which bounds…

We prove continuity and Harnack's inequality for bounded solutions to the equation $$ {\rm div}\big(|\nabla u|^{p(x)-2}\,\nabla u \big)=0, \quad p(x)= p + L\frac{\log\log\frac{1}{|x-x_{0}|}}{\log\frac{1}{|x-x_{0}|}},\quad L > 0, $$ under…

Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log…

The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…

We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…

Ramanujan's celebrated partition congruences modulo $\ell\in \{5, 7, 11\}$ assert that $$ p(\ell n+\delta_{\ell})\equiv 0\pmod{\ell}, $$ where $0<\delta_{\ell}<\ell$ satisfies $24\delta_{\ell}\equiv 1\pmod{\ell}.$ By proving Subbarao's…

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

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…

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a…

It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…

Let $\overline{p}(n)$ denote the overpartition function, and for $j\in \mathbb{N}$, $\Delta^r_j$ denote the $r$-fold applications of the shifted difference operator $\Delta_j$ defined by $\Delta_j(a)(n):=a(n)-a(n-j)$. The main goal of this…

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

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…

Let $p$ be prime, and let $p_{[1,p]}(n)$ denote the function whose generating function is $\prod (1-q^n)^{-1}(1 - q^{pn})^{-1}$. This function and its generalizations $p_{[c^{\ell}, d^m]}(n)$ are the subject of study in several recent…