Related papers: Uncomputably noisy ergodic limits

This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and non-computable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for…

Recently, there has been renewed interest in studying the asymptotic properties of the integer partition function $p(n)$. Hardy, Ramanujan, and Rademacher provided detailed asymptotic analysis for $p(n)$. Presently, attention has shifted…

We prove that a shift ergodic measure on a topologically mixing sub-shift is isomorphic to a Bernoulli shift whenever it is quasi invariant under permutations of finite number of coordinates. We prove also that Gibbs measures on…

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

Let $L^2(X,\Sigma,\mu,\tau)$ be a measure-preserving system, with $\tau$ a $\mathbb{Z}$-action. In this note, we prove that the ergodic averages along integer-valued polynomials, $P(n)$, \[ M_N(f):= \frac{1}{N}\sum_{n \leq N} \tau^{P(n)} f…

This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…

We introduce sufficient conditions on discrete singular integral operators for their maximal truncations to satisfy a sparse bound. The latter imply a range of quantitative weighted inequalities, which are new. As an application, we prove…

By employing an accelerated weighting method, we establish arbitrary polynomial and exponential pointwise convergence for multiple ergodic averages under general balancing conditions in both discrete and continuous settings, including…

In the absence of the axiom of choice, new results concerning sequential, Fr\'echet-Urysohn, $k$-spaces, very $k$-spaces, Loeb and Cantor completely metrizable spaces are shown. New choice principles are introduced. Among many other…

In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions $f$ there is a branching program computing a doubly exponential number of copies of $f$ which has linear size…

We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…

In the present paper it is shown that real function $g(x)=\int_{0}^{x}f(t)dt$ is a linear-space computable real function on interval $[0,1]$ if $f$ is a linear-space computable $C^2[0,1]$ real function on interval $[0,1]$, and this result…

Let $M$ be a complete simply connected manifold which is in addition Gromov hyperbolic, coercive and roughly starlike. For a given harmonic function on $M$, a local Fatou Theorem and a pointwise criteria of non-tangential convergence coming…

A long-standing open problem in harmonic analysis is: given a non-negative measure $\mu$ on $\mathbb R$, find the infimal width of frequencies needed to approximate any function in $L^2(\mu)$. We consider this problem in the "perturbative…

It is known that, for a positive Dunford-Schwartz operator in a noncommutative $L^p-$space, $1\leq p<\infty$ or, more generally, in a noncommutative Orlicz space with order continuous norm, the corresponding ergodic averages converge…

We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of…

The set of all error--correcting block codes over a fixed alphabet with $q$ letters determines a recursively enumerable set of rational points in the unit square with coordinates $(R,\delta)$:= (relative transmission rate, relative minimal…

We present a survey of ergodic theorems for actions of algebraic and arithmetic groups recently established by the authors, as well as some of their applications. Our approach is based on spectral methods employing the unitary…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…