相关论文: A Smoothed GPY Sieve

Many statistical problems include model parameters that are defined as the solutions to optimization sub-problems. These include classical approaches such as profile likelihood as well as modern applications involving flow networks or…

Using Duke's large sieve inequality for Hecke Gr{\"o}ssencharaktere and the new sieve methods of Maynard and Tao, we prove a general result on gaps between primes in the context of multidimensional Hecke equidistribution. As an application,…

We establish a general version of the Siegel-Sternberg linearization theorem for ultradiffentiable maps which includes the analytic case, the smooth case and the Gevrey case. It may regarded as a small divisior theorem without small divisor…

We amend the statement of point~(i) in Theorem~1.3 in arxiv:0901.1022 and supply the additional arguments and minor changes for the results that depend on it. We also seize the occasion and generalize to non-finitely generated lattices.

The hard edge Pearcey process is universal in random matrix theory and many other stochastic models. This paper deals with the gap probability for the thinned/unthinned hard edge Pearcey process over the interval $(0,s)$ by working on the…

The 2-opt heuristic is a simple local search heuristic for the Travelling Salesperson Problem (TSP). Although it usually performs well in practice, its worst-case running time is poor. Attempts to reconcile this difference have used…

We construct a new aperiodic symplectic plug and hence new smooth counterexamples to the Hamiltonian Seifert conjecture in R^{2n} for n>2. In other words, we develop an alternative procedure, to those of V. L. Ginzburg and M. Herman, for…

Explaining the excellent practical performance of the simplex method for linear programming has been a major topic of research for over 50 years. One of the most successful frameworks for understanding the simplex method was given by…

This very short correction notes a gap in an argument of an earlier paper, and also provides a theorem of similar flavor to the main result of that paper.

We implement the Gauge Theory Bootstrap (GTB) framework, initiated by He and Kruczenski in arXiv:2309.12402 and arXiv:2403.10772, using a discrete basis parametrization of the 2-to-2 pion scattering S-matrix, the spectral densities and the…

Erd\H{o}s considered the second moment of the gap-counting function of prime divisors in 1946 and proved an upper bound that is not of the right order of magnitude. We prove asymptotics for all moments. Furthermore, we prove a…

Weighted sieves are used to detect numbers with at most $S$ prime factors with $S \in \mathbb{N}$ as small as possible. When one studies problems with two variables in somewhat symmetric roles (such as Chen primes, that is primes $p$ such…

Discrepancy measures between probability distributions, often termed statistical distances, are ubiquitous in probability theory, statistics and machine learning. To combat the curse of dimensionality when estimating these distances from…

In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…

Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying complexity classes, like P and AvgP, respectively. While…

We derive the moderate deviation principles for the fluctuation fields of the facilitated exclusion process (FEP) in one dimension when the process starts from its stationary measure, both in the symmetric and asymmetric cases. The main…

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

We show that for any fixed base $a$, a positive proportion of primes have the property that they become composite after altering any one of their digits in the base $a$ expansion; the case $a=2$ was already established by Cohen-Selfridge…

This paper was written, apart from one technical correction, in July and August of 2013. The, then very recent, breakthrough of Y. Zhang \cite{Z} had revived in us an intention to produce a second edition of our book "Opera de Cribro", one…

For any $m \geq 1$, let $H_m$ denote the quantity $\liminf_{n \to \infty} (p_{n+m}-p_n)$. A celebrated recent result of Zhang showed the finiteness of $H_1$, with the explicit bound $H_1 \leq 70000000$. This was then improved by us (the…