Related papers: Algorithmic randomness and Fourier analysis

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…

We consider the space $A(\mathbb T)$ of all continuous functions $f$ on the circle $\mathbb T$ such that the sequence of Fourier coefficients $\hat{f}=\{\hat{f}(k), ~k \in \mathbb Z\}$ belongs to $l^1(\mathbb Z)$. The norm on $A(\mathbb T)$…

We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general…

This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…

We prove that the weak-$L^{p}$ norms, and in fact the sparse $(p,1)$-norms, of the Carleson maximal partial Fourier sum operator are $\lesssim (p-1)^{-1}$ as $p\to 1^+$. This is an improvement on the Carleson-Hunt theorem, where the same…

We prove the $L^p$-boundedness, $1<p<\infty$, of the Polynomial Carleson operator in general dimension. This follows the author's resolution of the one dimensional case as well as the work of Zorin-Kranich on the higher dimensional case in…

This paper is devoted to the $L^p(\mathbb R)$ theory of the fractional Fourier transform (FRFT) for $1\le p < 2$. In view of the special structure of the FRFT, we study FRFT properties of $L^1$ functions, via the introduction of a suitable…

We prove pointwise convergence for the scattering data of a Dirac system of differential equations. Equivalently, we prove an analog of Carleson's theorem on almost everywhere convergence of Fourier series for a version of the non-linear…

For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…

We prove the following extension of the Wiener--Wintner Theorem in Ergodic Theor and the Carleson Theorem on pointwise convergence of Fourier series: For all measure preserving flows $ (X,\mu , T_t)$ and $ f\in L^p (X,\mu)$, there is a set…

We develop a theory of multidimensional randomization in Lebesgue spaces $L^p$ with the aid of Kahane-Khintchine-Marcus-Pisier inequalities. More precisely, we obtain a result in the spirit of Maurey-Pisier's theorem which involves random…

Operators such as Carleson operator are known to be bounded on $L^p$ for all $1<p<\infty$, but not from $L^1$ to weak-$L^1$ and from $H^p$ to $L^p$ for each $0<p\leq 1$, the object of this article is to give a estimate for all $0<p<\infty$.…

Let $B^p_{\sigma}$, $1\le p<\infty$, $\sigma>0$, denote the space of all $f\in L^p(\mathbb{R})$ such that the Fourier transform of $f$ (in the sense of distributions) vanishes outside $[-\sigma,\sigma]$. The classical sampling theorem…

We study whether a uniformly random Boolean function $f : \{-1,1\}^p \to \{-1,1\}$ is determined by its Walsh--Fourier coefficients of degree at most $d$. We show that the threshold lies at $p/2$ up to an $O(\sqrt{p \log p})$ window: if \[…

S. Banach, in particular, proved that for any function, even $f(x) = 1,$ where $x\in[0,1],$ the convergence of its Fourier series with respect to the general orthonormal systems (ONS) is not guaranteed. In this paper, we find conditions for…

Stein and Wainger proved the $L^p$ bounds of the polynomial Carleson operator for all integer-power polynomials without linear term. In the present paper, we partially generalise this result to all fractional monomials in dimension one.…

We show that a computable function $f:\mathbb R\rightarrow\mathbb R$ has Luzin's property (N) if and only if it reflects $\Pi^1_1$-randomnes, if and only if it reflects $\Delta^1_1(\mathcal O)$-randomness, and if and only if it reflects…

We describe a greedy algorithm that approximates the Carleson constant of a collection of general sets. The approximation has a logarithmic loss in a general setting, but is optimal up to a constant with only mild geometric assumptions. The…

The classical Shannon sampling theorem states that a signal f with Fourier transform F in L^2(R) having its support contained in (-\pi,\pi) can be recovered from the sequence of samples (f(n))_{n in Z} via f(t)=\sum_{n in Z} f(n) (sin(\pi…

We extend a classical theorem of Carlson on moments of Dirichlet series from $p=2$ to $1 \leq p < \infty$. When combined with the ergodic theorem for the Kronecker flow, a coherent approach to almost sure properties of vertical limit…