English
Related papers

Related papers: Rademacher's infinite partial fraction conjecture …

200 papers

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

Combinatorics · Mathematics 2018-10-09 Jane Y. X. Yang

We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…

Combinatorics · Mathematics 2018-03-26 L. Bruce Richmond

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

Number Theory · Mathematics 2026-02-04 Christopher Atherfold

It is conjectured that for a perfect number $m,$ $\rm{rad}(m)\ll m^{\frac{1}{2}}.$ We prove bounds on the radical of multiperfect number $m$ depending on its abundancy index. Assuming the ABC conjecture, we apply this result to study gaps…

Number Theory · Mathematics 2019-01-01 Nithin Kavi , Xinyi Zhang , Viraj Jayam , Ajit Kadaveru

In this paper we consider error sums of the form \[\sum_{m=0}^{\infty} \varepsilon_m\Big( \,b_m\alpha - \frac{a_m}{c_m}\,\Big) \,,\] where $\alpha$ is a real number, $a_m$, $b_m$, $c_m$ are integers, and $\varepsilon_m=1$ or $\varepsilon_m…

Number Theory · Mathematics 2016-02-23 Thomas Baruchel , Carsten Elsner

The three gap theorem was originally a conjecture by Steinhaus, who asserted that there are at most three distinct gap lengths in the fractional parts of the sequence {\alpha},{2}{\alpha},{\cdots},{N}{\alpha} for any integer {N} and real…

Number Theory · Mathematics 2024-03-22 Huixing Zhang

Continuing pioneering work of Christophe Doche and Laurent Habsieger from 2004, we develop computer algebra algorithms, implemented in Maple, for finding the (necessarily rational) generating function for any integral of products, and in…

Combinatorics · Mathematics 2016-06-08 Shalosh B. Ekhad , Doron Zeilberger

Zeckendorf's Theorem states that any positive integer can be uniquely decomposed into a sum of distinct, non-adjacent Fibonacci numbers. There are many generalizations, including results on existence of decompositions using only even…

We study the problem of estimating the diagonal of an implicitly given matrix $A$. For such a matrix we have access to an oracle that allows us to evaluate the matrix vector product $Av$. For random variable $v$ drawn from an appropriate…

Data Structures and Algorithms · Computer Science 2022-01-27 Robert A. Baston , Yuji Nakatsukasa

In a recent paper (Asci \textit{et al.}, 2008) it has been shown that certain random continued fractions have a density which is a product of a beta density and a hypergeometric function $_{2}F_{1}$. In the present paper we fully exploit a…

Probability · Mathematics 2010-04-09 Gérard Letac , Mauro Piccioni

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…

Combinatorics · Mathematics 2017-03-22 Harrie Hendriks , Martien C. A. van Zuijlen

Let $G$ be a group and $H_1$,...,$H_s$ be subgroups of $G$ of indices $d_1$,...,$d_s$ respectively. In 1974, M. Herzog and J. Sch\"onheim conjectured that if $\{H_i\alpha_i\}_{i=1}^{i=s}$, $\alpha_i\in G$, is a coset partition of $G$, then…

Group Theory · Mathematics 2024-11-20 Fabienne Chouraqui

We investigate a fifty-year-old conjecture of Erd\H{o}s and Graham concerning whether the binomial coefficient ${n \choose k}$ with $1 \leq k \leq \frac{n}{2}$ must always have a divisor $\leq n$ that is ``close'' to $n$: that is, bigger…

Number Theory · Mathematics 2026-05-21 Hung M. Bui , Kyle Pratt , Alexandru Zaharescu

The parity of the partition function $p(n)$ remains strikingly mysterious. Beyond a handful of fragmentary results, essentially nothing is known about the distribution of parity. We prove a uniform result on quadratic progressions. If…

Number Theory · Mathematics 2025-10-06 Ken Ono

We prove an effective version of the Oppenheim conjecture with a polynomial error rate. The proof is based on an effective equidistribution theorem which in turn relies on recent progress towards restricted projection problem.

Dynamical Systems · Mathematics 2023-05-30 Elon Lindenstrauss , Amir Mohammadi , Zhiren Wang , Lei Yang

Carlitz considered integer compositions in which adjacent parts must be unequal. Arndt recently initiated the study of restricted compositions based on conditions applied to certain pairs of parts rather than to individual parts. Here, we…

Combinatorics · Mathematics 2025-12-16 Brian Hopkins , Aram Tangboonduangjit

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Number Theory · Mathematics 2025-09-29 A. David Christopher

Several conjectural continued fractions found with the help of various algorithms are published in this paper.

Number Theory · Mathematics 2017-04-14 Thomas Baruchel

Let $c(x)$ be a monic integer polynomial with coefficients $0$ or $1$. Write $c(x) = a(x) b(x)$ where $a(x)$ and $b(x)$ are monic polynomials with non-negative real (not necessarily integer) coefficients. The unfair 0--1 polynomial…

Number Theory · Mathematics 2023-07-17 Kevin G. Hare

We conjecture the full asymptotic expansion of a product of Riemann zeta functions, evaluated at the non-trivial zeros of the zeta function, with shifts added in each argument. By taking derivatives with respect to these shifts, we form a…

Number Theory · Mathematics 2025-09-10 Christopher Hughes , Andrew Pearce-Crump