相关论文: The large sieve with sparse sets of moduli

To analyse a very large data set containing lengthy variables, we adopt a sequential estimation idea and propose a parallel divide-and-conquer method. We conduct several conventional sequential estimation procedures separately, and properly…

In this paper we present a locally and dimension-adaptive sparse grid method for interpolation and integration of high-dimensional functions with discontinuities. The proposed algorithm combines the strengths of the generalised sparse grid…

We address a question posed by Ono, prove a general result for powers of an arbitrary prime, and provide an explanation for the appearance of higher congruence moduli for certain small primes. One of our results coincides with a recent…

We propose a generalization of SHGH Conjectures to a smooth projective surface Y: the so called Segre Problem. The study of linear systems on Y can be translated in terms of the Mori cone of the blow up $X = Bl_r Y$ at $r$ general points.…

We show a new large sieve version of the Brun-Titchmarsh theorem.

In this survey we provide an overview of some recent developments in the construction of moduli spaces using stack-theoretic techniques. We will also explain the analogue of Harder-Narasimhan stratifications for general stacks, known as…

We survey recent advances in the theory of moduli spaces of stable sheaves on hyperk\"ahler manifolds of dimension greater than $2$. We start by recalling the well-known theory in dimension $2$, i.e.~for $K3$ surfaces, emphasizing the…

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)…

In neural Information Retrieval (IR), ongoing research is directed towards improving the first retriever in ranking pipelines. Learning dense embeddings to conduct retrieval using efficient approximate nearest neighbors methods has proven…

We present novel methods for predicting the outcome of large elections. Our first algorithm uses a diffusion process to model the time uncertainty inherent in polls taken with substantial calendar time left to the election. Our second model…

We prove two-sided inequalities between the integral moduli of smoothness of a function on $\mathbb{R}^d/\mathbb{T}^d$ and the weighted tail-type integrals of its Fourier transform/series. Sharpness of obtained results in particular is…

We derive dispersion estimates for solutions of the one-dimensional discrete perturbed Schr\"odinger and wave equations. In particular, we improve upon previous works and weaken the conditions on the potentials. To this end we also provide…

In this paper, we confirm a smoothed version of a recent conjecture on the variance of the k-fold divisor function in arithmetic progressions to individual composite moduli, in a restricted range. In contrast to a previous result of Rodgers…

Recently M. Vuletic found a two-parameter generalization of the MacMahon's formula. In this note we show that certain ingredients of her formula have a clear interpretation in terms of the geometry of the moduli space of sheaves on the…

In this paper, we extend the large sieve type estimates to sums involving pth powers of trigonometric polynomials. An approach to such estimates that does not rely on the usual L^2-technique is given. Our method is based on comparing the…

We show that smooth numbers are equidistributed in arithmetic progressions to moduli of size $x^{66/107-o(1)}$. This overcomes a longstanding barrier of $x^{3/5-o(1)}$ present in previous works of Bombieri-Friedlander-Iwaniec,…

The Schulze method is a voting rule widely used in practice and enjoys many positive axiomatic properties. While it is computable in polynomial time, its straight-forward implementation does not scale well for large elections. In this…

We consider Bayesian variable selection in sparse high-dimensional regression, where the number of covariates $p$ may be large relative to the samples size $n$, but at most a moderate number $q$ of covariates are active. Specifically, we…

In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the same size. The algorithm depends on unproven heuristics that…

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…