Related papers: Algorithmic randomness and Fourier analysis

The main goal of the paper is to prove convergence in norm and pointwise almost everywhere on $L^p$, $p\in (1,\infty)$, for certain multiparameter polynomial ergodic averages in the spirit of Dunford and Zygmund for continuous flows. We…

Carleson and sparse collections of sets play a central role in dyadic harmonic analysis. We employ methods from optimization theory to study such collections. First, we present a strongly polynomial algorithm to compute the Carleson…

In this paper we prove a higher dimensional analogue of Carleson's $\varepsilon^2$ conjecture. Given two arbitrary disjoint open sets $\Omega^+,\Omega^-\subset \mathbb{R}^{n+1}$, and $x\in\mathbb{R}^{n+1}$, $r>0$, we denote…

Denote the coefficients in the complex form of the Fourier series of a function $f$ on the interval $[-\pi, \pi)$ by $\hat f(n)$. It is known that if $p = 2j/(2j-1)$ for some integer $j>0$, then for each function $f$ in $L^p$ there exists…

Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a…

The main result of this paper is a proof that, for any $f \in L_1[a,b]$, a sequence of its orthogonal projections $(P_{\Delta_n}(f))$ onto splines of order $k$ with arbitrary knots $\Delta_n$, converges almost everywhere provided that the…

We show that if A is a subset of Z/pZ (p a prime) of density bounded away from 0 and 1 then the A(Z/pZ)-norm (that is the l^1-norm of the Fourier transform) of the characterstic function of A is bounded below by an absolute constant times…

We prove the 'little Carleson theorem' on the growth of Fourier series for functions taking values in a UMD Banach space.

Various new sufficient conditions for representation of a function of several variables as an absolutely convergent Fourier integral are obtained in the paper. The results are given in terms of $L^p$ integrability of the function and its…

This is a survey of constructive and computable measure theory with an emphasis on the close connections with algorithmic randomness. We give a brief history of constructive measure theory from Brouwer to the present, emphasizing how…

Let $G$ be a locally compact group and $1\leq p<\infty$. A continuous unitary representation $\pi\!: G\to B(\mathcal{H})$ of $G$ is an $L^p$-representation if the matrix coefficient functions $s\mapsto \langle \pi(s)x,x\rangle$ lie in…

Consider the (Helgason-) Fourier transform on a Riemannian symmetric space G/K. We give a simple proof of the L^p-Schwartz space isomorphism theorem (0 <p \le 2) for K-finite functions. The proof is a generalization of J.-Ph. Anker's proof…

The Peterson-Thom conjecture asserts that any diffuse, amenable subalgebra of a free group factor is contained in a unique maximal amenable subalgebra. This conjecture is motivated by related results in Popa's deformation/rigidity theory…

Let $\sigma>0$. For $1\le p\le \infty$, the Bernstein space $B^p_{\sigma}$ is a Banach space of all $f\in L^p(R)$ such that $f$ is bandlimited to $\sigma$; that is, the distributional Fourier transform of $f$ is supported in $[-\sigma,…

Suppose a coin with unknown probability $p$ of heads can be flipped as often as desired. A Bernoulli factory for a function $f$ is an algorithm that uses flips of the coin together with auxiliary randomness to flip a single coin with…

We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…

In this article, we generalize a theorem of Victor L. Shapiro concerning nontangential convergence of the Poisson integral of a $L^p$-function. We introduce the notion of $\sigma$-points of a locally finite measure and consider a wide class…

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

Let $\{H_{n,m}\}_{n,m\in \mathbb{N}}$ be the two dimensional Haar system and $S_{n,m}f$ be the rectangular partial sums of its Fourier series with respect to some $f\in L^1([0,1)^2)$. Let $\mathcal{N}, \mathcal{M}\subset \mathbb{N}$ be two…