English
Related papers

Related papers: Rademacher's infinite partial fraction conjecture …

200 papers

In this paper, we develop the method of circle of partitions and associated statistics. As an application we prove conditionally the binary Goldbach conjecture. We develop a series of steps to prove the binary Goldbach conjecture in full.…

Number Theory · Mathematics 2026-03-16 Theophilus Agama

Zaremba's 1971 conjecture predicts that every integer appears as the denominator of a finite continued fraction whose partial quotients are bounded by an absolute constant. We confirm this conjecture for a set of density one.

Number Theory · Mathematics 2013-07-15 Jean Bourgain , Alex Kontorovich

The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartiitons is examined, bearing in…

Number Theory · Mathematics 2020-01-28 Andrew V. Sills

Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…

Symbolic Computation · Computer Science 2015-04-08 Graham H. Norton

It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…

Probability · Mathematics 2011-12-22 Martien C. A. van Zuijlen

Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of…

Number Theory · Mathematics 2026-01-28 Elias Dubno

The Riemann Hypothesis, originally proposed by the eminent mathematician Bernard Riemann in 1859, remains one of the most profound challenges in number theory. It posits that all non-trivial zeros of the Riemann zeta function {\zeta}(s) are…

General Mathematics · Mathematics 2024-08-27 Farid Kenas

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

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

Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the…

Combinatorics · Mathematics 2018-03-05 Anthony Zaleski , Doron Zeilberger

W.M.Schmit[11] conjectured that for any$\;\theta$ with deg$\;\theta\geq 3,$ there is no constant$\;C=C(\theta)$ so that$\;|p-q\theta|>Cq^{-1}$ for every rationa$\;p/q.$ [12,p26] states that the computations of the first several thousand…

Number Theory · Mathematics 2023-11-29 Jinxiang Li

A Rademacher-type convergent series formula which generalizes the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ and the Zuckerman formula for the Fourier coefficients of $\vartheta_4(0\vert \tau)^{-1}$ is presented.

Number Theory · Mathematics 2013-12-04 Andrew V. Sills

Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal…

Number Theory · Mathematics 2026-04-24 Jungwon Lee

In this paper, moderate deviations for normal approximation of functionals over infinitely many Rademacher random variables are derived. They are based on a bound for the Kolmogorov distance between a general Rademacher functional and a…

Probability · Mathematics 2024-06-12 Marius Butzek , Peter Eichelsbacher , Benedikt Rednoß

This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents…

Representation Theory · Mathematics 2010-11-25 Todor Milev

For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…

General Mathematics · Mathematics 2017-08-30 Juan A. Perez

Inspired by the recent pioneering work, dubbed "The Ramanujan Machine" by Raayoni et al. (arXiv:1907.00205), we (automatically) [rigorously] prove some of their conjectures regarding the exact values of some specific infinite continued…

Number Theory · Mathematics 2020-05-27 Robert Dougherty-Bliss , Doron Zeilberger

We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…

Combinatorics · Mathematics 2014-07-07 Stephen DeSalvo , Igor Pak

We apply Rademacher's method in order to compute the Fourier coefficients of a large class of $\eta$-quotients.

Number Theory · Mathematics 2017-10-27 Ethan Sussman

Famous Zaremba's conjecture (1971) states that for each positive integer $q\geq2$, there exists positive integer $1\leq a <q$, coprime to $q$, such that if you expand a fraction $a/q$ into a continued fraction $a/q=[a_1,\ldots,a_n]$, all of…

Number Theory · Mathematics 2023-10-20 Nikita Shulga