Related papers: The "bounded gaps between primes" Polymath project…

We study the collaborative PAC learning problem recently proposed in Blum et al.~\cite{BHPQ17}, in which we have $k$ players and they want to learn a target function collaboratively, such that the learned function approximates the target…

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…

Algorithmic stability is a classical approach to understanding and analysis of the generalization error of learning algorithms. A notable weakness of most stability-based generalization bounds is that they hold only in expectation.…

We use the lexicographic order to define a hierarchy of primal and dual bounds on the optimum of a bounded integer program. These bounds are constructed using lex maximal and minimal feasible points taken under different permutations. Their…

The purpose of this paper is to revisit the proof of the Gearhardt-Pr\"uss-Hwang-Greiner theorem for a semigroup $S(t)$, following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on $\Vert…

Hardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $\mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by…

In this paper, we study the bound on three kinds of hash family using the Singleton bound. To $\epsilon-U(N; n, m)$ hash family, in the caes of $n>m^2>1$ and $1\geq\epsilon\geq \epsilon_1(n, m)$, we get that the new bound is better. To…

Given integers $a$ and $m\ge 2$, let $\Hm$ be the following set of integral points $$ \Hm= \{(x,y) \ : \ xy \equiv a \pmod m,\ 1\le x,y \le m-1\} $$ We improve several previously known upper bounds on $v_a(m)$, the number of vertices of the…

Submodular maximization under various constraints is a fundamental problem studied continuously, in both computer science and operations research, since the late $1970$'s. A central technique in this field is to approximately optimize the…

Let $\Gamma$ be a finitely generated subgroup of the multiplicative group $\G_m^2(\bar{Q})$. Let $p(X,Y),q(X,Y)\in\bat{Q}$ be two coprime polynomials not both vanishing at $(0,0)$; let $\epsilon>0$. We prove that, for all $(u,v)\in\Gamma$…

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

The low-degree polynomial framework has emerged as a powerful tool for providing evidence of statistical-computational gaps in high-dimensional inference. For detection problems, the standard approach bounds the low-degree advantage through…

Building on the earlier works of Gadiyar and Padma, the main result of this paper is to prove: \begin{equation} \lim_{n \to \infty} \frac{1}{N} \sum_{n=1}^{N} \frac{\phi(n) \Lambda\left(n \right)}{n} \frac{\phi(n+h) \Lambda\left(n…

In the present work we investigate the largest possible gaps between consecutive numbers which can be written as the difference of two primes. The best known upper bounds are the same as those concerning the largest possible difference of…

In his seminal 1961 paper, Wirsing studied how well a given transcendental real number $\xi$ can be approximated by algebraic numbers $\alpha$ of degree at most $n$ for a given positive integer $n$, in terms of the so-called naive height…

Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomass\'{e} & Watrigant. Given two graphs $G$ and $H$ and a graph product $\star$, we address the question: is the twin-width of $G\star H$ bounded by a function of…

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…

Let $f$ be a polynomial in $n$ variables $x_1,\dots,x_n$ with real coefficients. In [Ghasemi-Marshal], Ghasemi and Marshall give an algorithm, based on geometric programming, which computes a lower bound for $f$ on $\mathbb{R}^n$. In…