English
Related papers

Related papers: Luzin's (N) and randomness reflection

200 papers

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

Computational Complexity · Computer Science 2009-11-13 Walid Gomaa

Consider a universal Turing machine that produces a partial or total function (or a binary stream), based on the answers to the binary queries that it makes during the computation. We study the probability that the machine will produce a…

Computational Complexity · Computer Science 2017-04-28 George Barmpalias , Douglas Cenzer , Christopher P. Porter

A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…

Logic · Mathematics 2024-05-24 George Barmpalias , Wei Wang

We characterise purely $n$-unrectifiable subsets $S$ of a complete metric space $X$ with finite Hausdorff $n$-measure by studying arbitrarily small perturbations of elements of the set of all bounded 1-Lipschitz functions $f\colon X \to…

Metric Geometry · Mathematics 2020-04-02 David Bate

Let F be a class of functions with the uniqueness property: if a function f in F vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a quantitative version of this property, e.g. a…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alexander Borichev , Fedor Nazarov , Mikhail Sodin

In the second part of our work on observables we have shown that quantum observables in the sense of von Neumann, i.e.bounded selfadjoint operators in some von Neumann subalgebra $R$ of $L(H)$, can be represented as bounded continuous…

Mathematical Physics · Physics 2007-05-23 Hans F. de Groote

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs

Let phi be a Dubins-Freedman random homeomorphism on [0,1] derived from the base measure uniform on the vertical line x=1/2, and let f be a periodic function satisfying that |f(x)-f(0)| = o(1/log log log 1/x). Then the Fourier expansion of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Gady Kozma

We prove that for a large class of functions $P$ and $Q$, there exists $d\in (0,1)$ such that the discrete bilinear Radon transform $$B^{\rm dis}_{P,Q}(f,g)(n)=\sum_{m\in\mathbb{Z}\setminus\{0\}} f(n-P(m))g(n-Q(m))\frac{1}{m}$$ is bounded…

Number Theory · Mathematics 2017-10-31 Dong Dong , Xianchang Meng

We find a formula that relates the Fourier transform of a radial function on $\mathbf{R}^n$ with the Fourier transform of the same function defined on $\mathbf{R}^{n+2}$. This formula enables one to explicitly calculate the Fourier…

Classical Analysis and ODEs · Mathematics 2013-02-19 Loukas Grafakos , Gerald Teschl

This article investigates the unique determination of a radial refractive index n from spectral data. First, we demonstrate that for piecewise twice continuously differentiable functions, n is not uniquely determined by the special…

Analysis of PDEs · Mathematics 2026-01-19 Kewen Bu , Youjun Deng , Yan Jiang , Kai Zhang

We determine all entire functions $f$ such that for nonzero complex values $a\neq b$ the implications $f=a \Rightarrow f' =a$ and $f' =b \Rightarrow f=b$ hold. This solves an open problem in uniqueness theory. In this context we give a…

Complex Variables · Mathematics 2024-03-26 Andreas Sauer , Andreas Schweizer

One of the main lines of research in algorithmic randomness is that of lowness notions. Given a randomness notion R, we ask for which sequences A does relativization to A leave R unchanged (i.e., R^A = R)? Such sequences are call low for R.…

Logic · Mathematics 2013-03-21 Laurent Bienvenu , Joseph S. Miller

We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solutions which are significantly worse than random. This enables…

Quantum Physics · Physics 2019-11-13 M. B. Hastings

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

Computational Complexity · Computer Science 2024-02-14 David Eppstein

If $R$ is an integral domain and $A$ is an $R$-algebra, then $A$ has the {\it Laurent cancellation property over $R$} if $A^{[\pm n]}\cong_RB^{[\pm n]}$ implies $A\cong_RB$ ($n\ge 0$ and $B$ an $R$-algebra). Here, $A^{[\pm n]}$ denotes the…

Commutative Algebra · Mathematics 2013-10-01 Gene Freudenburg

We show that part I of uniform Martin's conjecture follows from a local phenomenon, namely that if a non-constant Turing invariant function goes from the Turing degree $\boldsymbol x$ to the Turing degree $\boldsymbol y$, then $\boldsymbol…

Logic · Mathematics 2019-07-26 Vittorio Bard

Let $f(z) = \sum_{k=0}^\infty d_k z^k$, $d_k\in\mathbb{C}\backslash\{ 0 \}$, $d_0=1$, be a power series with a non-zero radius of convergence $\rho$: $0 <\rho \leq +\infty$. Denote by $f_n(z)$ the n-th partial sum of $f$, and $R_{2n}(z) =…

Classical Analysis and ODEs · Mathematics 2022-08-16 Sergey M. Zagorodnyuk

Let f be a C1 bivariate function with Lipschitz derivatives, and F = {x $\in$ R2 : f(x) $\lambda$} an upper level set of f, with $\lambda$ $\in$ R. We present a new identity giving the Euler characteristic of F in terms of its three-points…

Probability · Mathematics 2018-12-10 Raphaël Lachièze-Rey

The No-Cloning property in Quantum Computation is known not to depend on the unitarity of the operators involved, but only on their linearity. Based on that fact, here it is shown that the No-Cloning property remains valid when Quantum…

General Physics · Physics 2009-02-03 Elemer E Rosinger