Related papers: Functions that preserve p-randomness

We show that any matrix-polynomial combination of free noncommutative random variables each having an algebraic law has again an algebraic law. Our result answers a question raised by a recent paper of Shlyakhtenko and Skoufranis. The…

We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

We reprove a result of Boppana and Lagarias: If Pi_2^P is different from Sigma_2^P then there exists a partial function f that is computable by a polynomial-size family of circuits, but no inverse of f is computable by a polynomial-size…

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

We define a p-norm in the context of quantum random variables, measurable operator-valued functions with respect to a positive operator-valued measure. This norm leads to a operator-valued L^p space that is shown to be complete. Various…

Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…

We prove an implicit function theorem for non-commutative functions. We use this to show that if $p(X,Y)$ is a generic non-commuting polynomial in two variables, and $X$ is a generic matrix, then all solutions $Y$ of $p(X,Y)=0$ will commute…

We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…

Let $\Re_n$ be the set of all rational functions of the type $r(z) = p(z)/w(z),$ where $p(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-a_j)$, $|a_j|>1$ for $1\leq j\leq n$. In this paper, we set up some results…

We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…

Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision…

We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L\"of random left-computably enumerable reals has a Friedberg numbering, as does the family of…

In Micchelli's paper "Interpolation of scattered data: distance matrices and conditionally positive functions", deep results were obtained concerning the invertibility of matrices arising from radial basis function interpolation. In…

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…

This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…

We consider the algebras $M_p$ of Fourier multipliers and show that every bounded continuous function $f$ on $\mathbb R^d$ can be transformed by an appropriate homeomorphic change of variable into a function that belongs to $M_p(\mathbb…

Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…

For a nonempty polyhedral set $P\subset \mathbb R^d$, let $\mathcal F(P)$ denote the set of faces of $P$, and let $N(P,F)$ be the normal cone of $P$ at the nonempty face $F\in\mathcal F(P)$. We prove that the function $\sum_{F\in\mathcal…