Related papers: Functions that preserve p-randomness

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

In this paper, we introduce and investigate a class P of continuous and periodic functions on R. The class P is defined so that second-order central differences of a function satisfy some concavity-type estimate. Although this definition…

We provide detailed local descriptions of stable polynomials in terms of their homogeneous decompositions, Puiseux expansions, and transfer function realizations. We use this theory to first prove that bounded rational functions on the…

We introduce $p$-adic Kummer spaces of continuous functions on $\mathbb{Z}_p$ that satisfy certain Kummer type congruences. We will classify these spaces and show their properties, for instance, ring properties and certain decompositions.…

This note studies, and partially solves, 3 elementary questions about continuous rational functions on real (and p-adic) algebraic varieties: Can one restrict such a function to a subvariety? Can one extend such a function from a…

Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…

A theorem of A. and C. R\'enyi on periodic entire functions states that an entire function $f(z) $ must be periodic if $ P(f(z)) $ is periodic, where $ P(z) $ is a non-constant polynomial. By extending this theorem, we can answer some open…

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…

We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…

Let $1/2\leq\beta<1$, $p$ be a generic prime number and $f_\beta$ be a random multiplicative function supported on the squarefree integers such that $(f_\beta(p))_{p}$ is an i.i.d. sequence of random variables with distribution…

Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be…

In this paper the properties of R\'edei rational functions are used to derive rational approximations for square roots and both Newton and Pad\'e approximations are given as particular cases. As a consequence, such approximations can be…

We probabilistically analyze the performance of the arithmetic coding algorithm under a probability model for binary data in which a message is received by a coder from a source emitting independent equally distributed bits, with 1…

We introduce a new bounded theory RS^1_2 and show that the functions which are Sigma^b_1-representable in it are precisely random functions which can be computed in polynomial time. Concretely, we pass through a class of oracle functions…

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

Let D be the open unit disc in C. The paper deals with the following conjecture: If f is a continuous function on bD such that the change of argument of Pf+1 around bD is nonnegative for every polynomial P such that Pf+1 has no zero on bD…

Let $\cal{P}$ be an affine invariant property of functions $\mathbb{F}_p^n \to [R]$ for fixed $p$ and $R$. We show that if $\cal{P}$ is locally testable with a constant number of queries, then one can estimate the distance of a function $f$…

We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed value…

Schnorr showed that a real is Martin-Loef random if and only if all of its initial segments are incompressible with respect to prefix-free complexity. Fortnow and independently Nies, Stephan and Terwijn noticed that this statement remains…

We prove a multiple recurrence result for arbitrary measure-preserving transformations along polynomials in two variables of the form $m+p_i(n)$, with rationally independent $p_i$'s with zero constant term. This is in contrast to the single…