Related papers: Functions that preserve p-randomness

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the ex- istence of such functions g and h. In this thesis we consider functional decom- positions…

We show that any periodic with respect to normal subgroups (of the group representation of the Cayley tree) of finite index $p$-harmonic function is a constant. For some normal subgroups of infinite index we describe a class of…

Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…

We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists…

The property that a one to one function from the natural numbers to itself preserves the density of sub-sets is shown to be equivalent to a condition on the covering of intervals in the range of the function by images of intervals in the…

The notion of Schnorr randomness refers to computable reals or computable functions. We propose a version of Schnorr randomness for subcomputable classes and characterize it in different ways: by Martin L\"of tests, martingales or measure…

We consider some multivariate rational functions which have (or are conjectured to have) only positive coefficients in their series expansion. We consider an operator that preserves positivity of series coefficients, and apply the inverse…

We study rational functions admitting a continuous extension to the real affine space. First of all, we focus on the regularity of such functions exhibiting some nice properties of their partial derivatives. Afterwards, since these…

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

The main purpose of this work is to ascertain when arithmetic operations with periodic functions whose domains may not coincide with the whole real line preserve periodicity.

We consider the class of counting problems,i.e. functions in $\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example,…

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…

According to [5] we define the $*$-exponential of a slice-regular function, which can be seen as a generalization of the complex exponential to quaternions. Explicit formulas for $\exp_*(f)$ are provided, also in terms of suitable sine and…

In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…

For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…

We point out a simple criterion for convergence of polynomials to a concrete entire function in the Laguerre-P\'{o}lya ($\mathcal{LP}$) class (of all functions arising as uniform limits of polynomials with only real roots). We then use this…