Related papers: Smoothness and decay properties of the limiting Qu…
A trigonometric series strongly bounded at two points and with coefficients forming a log-quasidecreasing sequence is necessarily the Fourier series of a function belonging to all $L^{p}$ spaces, $1\leq p < \infty$. We obtain new results on…
Starting with the Fourier integral theorem, we present natural Monte Carlo estimators of multivariate functions including densities, mixing densities, transition densities, regression functions, and the search for modes of multivariate…
The well-known Kruskal-Katona theorem in combinatorics says that (under mild conditions) every monotone Boolean function $f: \{0,1\}^n \to \{0,1\}$ has a nontrivial "density increment." This means that the fraction of inputs of Hamming…
We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…
Deconvolution is the important problem of estimating the distribution of a quantity of interest from a sample with additive measurement error. Nearly all methods in the literature are based on Fourier transformation because it is…
Towards a well-known open question in arithmetic dynamics, L. M\'erai, A. Ostafe and I. E. Shparlinski (2023), have shown, for a class of polynomials $f \in \mathbb Z[X]$, which in particular includes all quadratic polynomials, that, under…
Let $\Psi(x,y)$ denote the count of $y$-smooth numbers below $x$ and $P(n)$ denote the largest prime factor of $n$. We prove that for $f$ a Steinhaus random multiplicative function, the partial sums over $y$-smooth numbers always enjoy…
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…
A classical result in number theory is Dirichlet's theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly k prime factors for k>1. Building upon a proof by E.M. Wright in 1954, we…
We derive fundamental sampling bounds for smooth signals in continuous settings without sparsity assumptions. By introducing the Fourier ratio as a measure of spectral compressibility induced by smoothness, we obtain explicit, deterministic…
Over the last 10 years or so, advanced statistical properties, including exponential decay of correlations, have been established for certain classes of singular hyperbolic flows in three dimensions. The results apply in particular to the…
The principle of smooth fit is probably the most used tool to find solutions to optimal stopping problems of one-dimensional diffusions. It is important, e.g., in financial mathematical applications to understand in which kind of models and…
A topological space is iso-dense if it has a dense set of isolated points. A topological space is scattered if each of its non-empty subspaces has an isolated point. In $\mathbf{ZF}$, in the absence of the axiom of choice, basic properties…
We study divisibility properties of a set $\{f_1(\mathbf{U}_n^{(s)}),\ldots,f_m(\mathbf{U}_n^{(s)})\}$, where $f_1,\ldots,f_m$ are polynomials in $s$ variables over $\mathbb{Z}$ and $\mathbf{U}_n^{(s)}$ is a point picked uniformly at random…
A density function for an algebraic invariant is a measurable function on $\mathbb{R}$ which measures the invariant on an $\mathbb{R}$-scale. This function carries a lot more information related to the invariant without seeking extra data.…
Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we first deal with the mathematical analysis of the Quicksort…
We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…
We explore the extent to which the Fourier transform of an $L^p$ density supported on the sphere in $\mathbb{R}^n$ can have large mass on affine subspaces, placing particular emphasis on lines and hyperplanes. This involves establishing…
We identify an assumption on linear forms $\phi_1, \dots, \phi_k: \mathbb{F}_p^n \to \mathbb{F}_p$ that is much weaker than approximate joint equidistribution on the Boolean cube $\{0,1\}^n$ and is in a sense almost as weak as linear…
For a sample set of 1024 values, the FFT is 102.4 times faster than the discrete Fourier transform (DFT). The basis for this remarkable speed advantage is the `bit-reversal' scheme of the Cooley-Tukey algorithm. Eliminating the burden of…