相关论文: A Smoothed GPY Sieve

We show that vanishing of asymptotic p-th syzygies implies p-very ampleness for line bundles on arbitrary projective schemes. For smooth surfaces we prove that the converse holds when p is small, by studying the Bridgeland-King-Reid-Haiman…

The existence of the Gorenstein projective precovers over $R$ an arbitrary ring, as well as the completeness of the Gorenstein projective cotorsion pair $(\mathcal{GP},\mathcal{GP}^{\perp})$, are open questions. In this paper, we provide…

We study the gaps between products of two primes in imaginary quadratic number fields using a combination of the methods of Goldston-Graham-Pintz-Yildirim \cite{GGPY}, and Maynard \cite{MAY}. An important consequence of our main theorem is…

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

The Selberg sieve provides majorants for certain arithmetic sequences, such as the primes and the twin primes. We prove an L^2-L^p restriction theorem for majorants of this type. An immediate application is to the estimation of exponential…

Most results on Stochastic Gradient Descent (SGD) in the convex and smooth setting are presented under the form of bounds on the ergodic function value gap. It is an open question whether bounds can be derived directly on the last iterate…

This note complements a recent paper of Chatzakos, Harcos and Kaneko \cite{CHK}. We use a Dirichlet style Prime Geodesic Theorem to improve the error term estimate in loc. cit. at the cost of lowering the resolution. The proof relies on the…

In this paper, we introduce a new approach to proving the convergence of the Stochastic Approximation (SA) and the Stochastic Gradient Descent (SGD) algorithms. The new approach is based on a concept called GSLLN (Generalized Strong Law of…

The purpose of this short article is to prove some potential estimates that naturally arise in the study of subelliptic Sobolev inequalites for functions. This will allow us to prove a local subelliptic Sobolev inequality with the optimal…

We show that for all large enough $x$ the interval $[x,x+x^{1/2}\log^{1.39}x]$ contains numbers with a prime factor $p > x^{18/19}.$ Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the…

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

The smoothing technique of Savitzky and Golay is extended to data defined on multidimensional meshes. A smoothness-increasing accuracy-conserving (SIAC) filter is defined that is suitable for use with finite-element computation.

The bounded gaps property of the prime numbers, as proven by Yitang Zhang, is considered for sequences of lengths of closed geodesics, which by the theory of Selberg zeta functions are the geometric analogue of the prime numbers. It turns…

The smoothing parameter $\eta_{\epsilon}(\mathcal{L})$ of a Euclidean lattice $\mathcal{L}$, introduced by Micciancio and Regev (FOCS'04; SICOMP'07), is (informally) the smallest amount of Gaussian noise that "smooths out" the discrete…

In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…

The symplectic isotopy conjecture states that every smooth symplectic surface in $CP^2$ is symplectically isotopic to a complex algebraic curve. Progress began with Gromov's pseudoholomorphic curves [Gro85], and progressed further…

Making predictions and quantifying their uncertainty when the input data is sequential is a fundamental learning challenge, recently attracting increasing attention. We develop SigGPDE, a new scalable sparse variational inference framework…

In [Kim05], Kim gave a new proof of Siegel's Theorem that there are only finitely many $S$-integral points on $\mathbb P^1_{\mathbb Z}\setminus\{0,1,\infty\}$. One advantage of Kim's method is that it in principle allows one to actually…

Thompson Sampling (TS) from Gaussian Process (GP) models is a powerful tool for the optimization of black-box functions. Although TS enjoys strong theoretical guarantees and convincing empirical performance, it incurs a large computational…

A smoothing algorithm is presented for solving the soft-margin Support Vector Machine (SVM) optimization problem with an $\ell^{1}$ penalty. This algorithm is designed to require a modest number of passes over the data, which is an…