Related papers: An improved bound on the least common multiple of …

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

We use Toponogov's triangle comparison theorem from Riemannian geometry along with quantitative scale oriented variants of classical propagation of singularities arguments to obtain logarithmic improvements of the Kakeya-Nikodym norms…

Kupavskii proved a codegree version of the Erd\H{o}s--Ko--Rado theorem by showing that for an intersecting family $\mathcal{F} \subseteq \binom{[n]}{k}$ with $n \geq 2k +3d/(1-d/k)$, the minimum $d$-degree of $\mathcal{F}$ is at most…

Let $K$ be a number field and $f: \mathbb{P}^1 \to \mathbb{P}^1$ a rational map of degree $d \geq 2$ with at most $s$ places of bad reduction, where we include all archimedean places. We prove that there exists constants $c_1,c_2 > 0$,…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

We consider the problem of testing whether an unknown Boolean function $f$ is monotone versus $\epsilon$-far from every monotone function. The two main results of this paper are a new lower bound and a new algorithm for this well-studied…

There are a couple of proofs by now for the famous Cwikel--Lieb--Rozenblum (CLR) bound, which is a semiclassical bound on the number of bound states for a Schr\"odinger operator, proven in the 1970s. Of the rather distinct proofs by Cwikel,…

We study the logarithm of the least common multiple of the sequence of integers given by $1^2+1, 2^2+1,..., n^2+1$. Using a result of Homma on the distribution of roots of quadratic polynomials modulo primes we calculate the error term for…

For univalent and normalized functions $f$ the logarithmic coefficients $\gamma_n(f)$ are determined by the formula $\log(f(z)/z)=\sum_{n=1}^{\infty}2\gamma_n(f)z^n$. In the paper \cite{Pon} the authors posed the conjecture that a locally…

Let $f:[0,1]^d\to\mathbb{R}$ be a completely monotone integrand as defined by Aistleitner and Dick (2015) and let points $\boldsymbol{x}_0,\dots,\boldsymbol{x}_{n-1}\in[0,1]^d$ have a non-negative local discrepancy (NNLD) everywhere in…

Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…

An inequality proved firstly by Remak and then generalized by Friedman shows that there are only finitely many number fields with a fixed signature and whose regulator is less than a prescribed bound. Using this inequality, Astudillo, Diaz…

Let $f$ be a real-valued $1$-bounded multiplicative function. Suppose that the mean-value of $f^{2}$ exists, and $$\int_{0}^{1} \Big | \sum_{n \leq N} f(n)e^{2\pi i n \alpha} \Big | d \alpha\leq N^{o(1)}$$ as $N \rightarrow \infty$, then…

This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…

We prove a lower bound of $\tilde{\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is monotone or far from monotone. This…

Consider a degree-$d$ polynomial $f(\xi_1,\dots,\xi_n)$ of independent Rademacher random variables $\xi_1,\dots,\xi_n$. To what extent can $f(\xi_1,\dots,\xi_n)$ concentrate on a single point? This is the so-called polynomial…

Let $\varepsilon\in(0,1)$ and $X\subset\mathbb R^d$ be arbitrary with $|X|$ having size $n>1$. The Johnson-Lindenstrauss lemma states there exists $f:X\rightarrow\mathbb R^m$ with $m = O(\varepsilon^{-2}\log n)$ such that $$ \forall x\in X\…

Let $(H(n))_{n \geq 0} $ be a $2-$dimensional Halton's sequence. Let $D_{2} ( (H(n))_{n=0}^{N-1}) $ be the $L_2$-discrepancy of $ (H_n)_{n=0}^{N-1} $. It is known that $\limsup_{N \to \infty } (\log N)^{-1} D_{2} ( H(n) )_{n=0}^{N-1} >0$.…

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

In 1981 Beck and Fiala proved an upper bound for the discrepancy of a set system of degree d that is independent of the size of the ground set. In the intervening years the bound has been decreased from 2d-2 to 2d-4. We improve the bound to…