Related papers: Generalizing the Clunie--Hayman construction in an…
Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…
Let $M(x)=\sum_{1\le n\le x}\mu(n)$ where $\mu$ is the M\"obius function. It is well-known that the Riemann Hypothesis is equivalent to the assertion that $M(x)=O(x^{1/2+\epsilon})$ for all $\epsilon>0$. There has been much interest and…
We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…
Wierzba and Wisniewski proved that in dimension 4, every bimeromorphic map of hyperkahler manifolds is represented as a composition of Mukai flops. Hu and Yau conjectured that this result can be generalized to arbitrary dimension. They…
Let $A_f(1,n)$ be the normalized Fourier coefficients of a $GL(3)$ Maass cusp form $f$ and let $a_g(n)$ be the normalized Fourier coefficients of a $GL(2)$ cusp form $g$. Let $\lambda(n)$ be either $A_f(1,n)$ or the triple divisor function…
We study the values of the M\"obius function $\mu$ of intervals in the containment poset of permutations. We construct a sequence of permutations $\pi_n$ of size $2n-2$ for which $\mu(1,\pi_n)$ is given by a polynomial in $n$ of degree 7.…
An application of (iterated) Bauer-Muir acceleration can give an Ap\'ery-like continued fraction for $\pi$ with irrational coefficients, and much faster convergence. It can be considered a generalized continued fraction with the same matrix…
Define a \textit{$t$-matching} of size $m$ in a $k$-uniform family as a collection $\{A_1, A_2, \ldots, A_m\} \subseteq \binom{[n]}{k}$ such that $|A_i \cap A_j| < t$ for all $1 \leq i < j \leq m$. Let $\mathcal{F}\subseteq \binom{[n]}{k}$.…
We say that two graphs on the same vertex set are $G$-creating if their union (the union of their edges) contains $G$ as a subgraph. Let $H_n(G)$ be the maximum number of pairwise $G$-creating Hamiltonian paths of $K_n$. Cohen, Fachini and…
Let $\Sigma=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erd\H{o}s states that $a_n>C\cdot 2^n$ for some constant $C$, while the…
This paper is concerned with the surface embedding of matching extendable graphs. There are two directions extending the theory of perfect matchings, that is, matching extendability and factor-criticality. In solving a problem posed by…
Erd\H{o}s proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that…
Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Set $H_0:=H_1\cap H_2\cap...\cap H_n$ and let $P_k$ be the orthogonal projection onto $H_k$, $k=0,1,...,n$. The paper is devoted to the study of functions…
For $x\in [0,1],$ the run-length function $r_n(x)$ is defined as the length of the longest run of $1$'s amongst the first $n$ dyadic digits in the dyadic expansion of $x.$ Erd\H{o}s and R\'enyi proved that…
We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…
In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…
Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…
A general lower bound is developed for the minimax risk when estimating an arbitrary functional. The bound is based on testing two composite hypotheses and is shown to be effective in estimating the nonsmooth functional…
The Erd\H os Matching Conjecture states that the maximum size $f(n,k,s)$ of a family $\mathcal{F}\subseteq \binom{[n]}{k}$ that does not contain $s$ pairwise disjoint sets is $\max\{|\mathcal{A}_{k,s}|,|\mathcal{B}_{n,k,s}|\}$, where…
We apply recent progress on Vinogradov's mean value theorem to improve bounds for the function $H(k)$ in the Waring-Goldbach problem. We obtain new results for all exponents $k \ge 7$, and in particular establish that for large $k$ one has…