Related papers: Fourier optimization and consequences of the gener…

In the present work we prove a common generalization of Maynard-Tao's recent result about consecutive bounded gaps between primes and on the Erd\H{o}s-Rankin bound about large gaps between consecutive primes. The work answers in a strong…

We consider the quadratic optimization problem $$F_n^{W,h}:= \sup_{x \in S^{n-1}} ( x^T W x/2 + h^T x )\,, $$ with $W$ a (random) matrix and $h$ a random external field. We study the probabilities of large deviation of $F_n^{W,h}$ for $h$ a…

We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…

In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…

We establish upper bounds for shifted moments of modular $L$-functions to a fixed modulus as well as quadratic twists of modular $L$-functions under the generalized Riemann hypothesis. Our results are then used to establish bounds for…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We present an optimization problem emerging from optimal control theory and situated at the intersection of fractional programming and linear max-min programming on polytopes. A na\"ive solution would require solving four nested, possibly…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…

We propose an extremely versatile approach to address a large family of matrix nearness problems, possibly with additional linear constraints. Our method is based on splitting a matrix nearness problem into two nested optimization problems,…

We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…

We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel…

We propose a novel Riemannian method for solving the Extreme multi-label classification problem that exploits the geometric structure of the sparse low-dimensional local embedding models. A constrained optimization problem is formulated as…

Assuming that there exist (infinitely many) Siegel zeros, we show that the (Rosser-)Jurkat-Richert bounds in the linear sieve cannot be improved, and similarly look at Iwaniec's lower bound on Jacobsthal's problem, as well as minor…

We study operators that are generalizations of the classical Riemann-Liouville fractional integral, and of the Riemann-Liouville and Caputo fractional derivatives. A useful formula relating the generalized fractional derivatives is proved,…

We study several consequences of the packing problem, a conjecture from combinatorial optimization, using algebraic invariants of square-free monomial ideals. While the packing problem is currently unresolved, we successfully settle the…

This paper proposes a general framework of Riemannian adaptive optimization methods. The framework encapsulates several stochastic optimization algorithms on Riemannian manifolds and incorporates the mini-batch strategy that is often used…

Shortened abstract: Given a constrained minimization problem, under what conditions does there exist a related, unconstrained problem having the same minimum points? This basic question in global optimization motivates this paper, which…

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…