Related papers: On a Lower Bound for $\|(4/3)^k\|$
We provide a nontrivial bound on the rank of any tensor $T$ over the quaternions $\mathbb{H}$ in the $n_1\times n_2\times n_3$ cases where $2\leq n_i\leq 3$. We describe a decomposition of $T$ into $3$ simple tensors in the $2\times 2\times…
Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…
Let $k$ and $\ell$ be positive integers. We prove that if $1 \leq \ell \leq o_k(k^{6/5})$, then in every large enough graph $G$, the fraction of $k$-vertex subsets that induce exactly $\ell$ edges is at most $1/e + o_k(1)$. Together with a…
Lagarias, Montgomery, and Odlyzko proved that there exists an effectively computable absolute constant $A_1$ such that for every finite extension $K$ of ${\mathbb{Q}}$, every finite Galois extension $L$ of $K$ with Galois group $G$ and…
We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…
Let $f\in \mathbb{R}[x_1,\ldots, x_k]$, for $k\ge 2$. For any finite sets $A_1,\ldots, A_k\subset \mathbb{R}$, consider the set $$ f(A_1,\ldots, A_k):=\{f(a_1,\ldots, a_k)\mid (a_1,\cdots,a_k)\in A_1\times\cdots \times A_k\}, $$ that is,…
The current best approximation algorithms for $k$-median rely on first obtaining a structured fractional solution known as a bi-point solution, and then rounding it to an integer solution. We improve this second step by unifying and…
We prove that if $A\subseteq \{ 1,2,\dots, N \}$ does not contain any solution to the equation $x_1+\dots+x_k=y_1+\dots+y_k$ with distinct $x_1,\dots,x_k,y_1,\dots,y_k\in A$, then $|A|\ll {k^{3/2}}N^{1/k}.$
This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…
We prove that if $A\subset \{1,\dots,N\}$ has no nontrivial three-term arithmetic progressions, then $|A|\leq \exp(-c\log(N)^{1/6}\log\log(N)^{-1})N$ for some absolute constant $c>0$. To obtain this bound, we use an iterated variant of the…
We ask, for which $n$ does there exists a $k$, $1 \leq k < n$ and $(k,n)=1$, so that $k/n$ has a continued fraction whose partial quotients are bounded in average by a constant $B$? This question is intimately connected with several other…
Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denotes the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $1<c<12/11$ there exist infinitely…
Let $P(m)$ denote the greatest prime factor of $m$. For integer $a>1$, M. Ram Murty and S. Wong proved that, under the assumption of the ABC conjecture, $$P(a^n-1)\gg_{\epsilon, a} n^{2-\epsilon}$$ for any $\epsilon>0$. We study analogues…
10 is the smallest positive integer which is whether solitary or friendly is still an open question in mathematics. In this paper, we provide upper bounds for each of the prime divisors of a friend of 10. This paper is precisely a…
The purpose of this article is to describe a reduction of the slicing problem to the study of the parameter I_1(K,Z_q^o(K))=\int_K ||< :, x> ||_{L_q(K)}dx. We show that an upper bound of the form I_1(K,Z_q^o(K))\leq C_1q^s\sqrt{n}L_K^2,…
We prove that the blocklength $n$ of a linear $3$-query locally correctable code (LCC) $\mathcal{L} \colon {\mathbb F}^k \to {\mathbb F}^n$ with distance $\delta$ must be at least $n \geq 2^{\Omega\left(\left(\frac{\delta^2 k}{(|{\mathbb…
Eberhard and Pohoata conjectured that every $3$-cube-free subset of $[N]$ has size less than $2N/3+o(N)$. In this paper we show that if we replace $[N]$ with $\mathbb{Z}_N$ the upper bound of $2N/3$ holds, and the bound is tight when $N$ is…
We prove that there is a prime between $n^3$ and $(n+1)^3$ for all $n \geq \exp(\exp(33.217))$. Our new tool which we derive is a version of Landau's explicit formula for the Riemann zeta-function with explicit bounds on the error term. We…
Matom\"aki proved that if $\alpha\in \mathbb{R}$ is irrational, then there are infinitely many primes $p$ such that $|\alpha-a/p|\le p^{-4/3+\varepsilon}$ for a suitable integer a. In this paper, we extend this result to all quadratic…
Let $K$ be a number field with the discriminant $D_K$ and the class number $h_{K}$, which has bounded degree over $\mathbb{Q}$. By assuming GRH, we prove that every ideal class of $K$ contains a prime ideal with norm less than…