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

We investigate analytical properties of free stable distributions and discover many connections with their classical counterparts. Our main result is an explicit formula for the Mellin transform, which leads to explicit series…

Let $CH(R)$ denote the family of characteristic functions of probability measures (distributions) on the real line $R$. We study the following question: given an integer $n>1$, do there exist two different $f, g\in CH(R)$ such that $…

Let $f$ and $g$ be weakly holomorphic modular functions on $\Gamma_0(N)$ with the trivial character. For an integer $d$, let $\Tr_d(f)$ denote the modular trace of $f$ of index $d$. Let $r$ be a rational number equivalent to $i\infty$ under…

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…

We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…

Randomness in the sense of Martin-L\"of can be defined in terms of lower semicomputable supermartingales. We show that such a supermartingale cannot be replaced by a pair of supermartingales that bet only on the even bits (the first one)…

We prove that all functions obeying the Kramers-Kronig relations can be approximated as superpositions of Lorentzian functions, to any precision. As a result, the typical text-book analysis of dielectric dispersion response functions in…

A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…

We show that the classical kernel and domain functions associated to an n-connected domain in the plane are all given by rational combinations of three or fewer holomorphic functions of one complex variable. We characterize those domains…

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…

A Martin-L\"of test $\mathcal U$ is universal if it captures all non-Martin-L\"of random sequences, and it is optimal if for every ML-test $\mathcal V$ there is a $c \in \omega$ such that $\forall n(\mathcal{V}_{n+c} \subseteq…

Extending the notion of bounded variation, a function $u \in L_c^1(\mathbb R^n)$ is of bounded fractional variation with respect to some exponent $\alpha$ if there is a finite constant $C \geq 0$ such that the estimate \[ \biggl|\int u(x)…

Let $X$ be an arbitrary real-valued random variable (r.v.), with the characteristic function (c.f.) $f$. Integral expressions for the c.f.\ of the r.v.'s $\max(0,X)$ in terms of $f$ are given, as well as other related results. Applications…

Let $f$ be a transcendental meromorphic function in the complex plane $\mathbb{C}$, and $a$ be a nonzero complex number . We give quantitative estimates for the characteristic function $T(r,f)$ in terms of $N(r,1/(f^l(f^{(k)})^n-a))$, for…

We continue the investigation of algorithmically random functions and closed sets, and in particular the connection with the notion of capacity. We study notions of random continuous functions given in terms of a family of computable…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

We completely classify Laurent series converging on the unit circle over a non-Archimedean local field (of any characteristic) that map infinitely many roots of unity to roots of unity. For a given Laurent series $f$ over a field of…

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…

To demonstrate more visibly the close relation between the continuity and integrability, a new proof for the Banach-Zarecki theorem is presented on the basis of the Radon-Nikodym theorem which emphasizes on measure-type properties of the…