Related papers: A Family of Iterated Maps on Natural Numbers

Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…

Let $q$ be a prime power and $\phi$ a rational function with coefficients in a finite field $\mathbb{F}_q$. For $n \geq 1$, each element of $\mathbb{P}^1(\F_{q^n})$ is either periodic or strictly preperiodic under iteration of $\phi$.…

We introduce an harmonic analysis for iterated function systems (IFS) (X, mu) which is based on a Markov process on certain paths. The probabilities are determined by a weight function W on X. From W we define a transition operator R_W…

We provide an overview of iterated function systems (IFS), where randomly chosen state-to-state maps are applied iteratively to a state. We aim to summarize the state of art and, where possible, identify fundamental challenges and…

We introduce \emph{patterned numbers}, a digit--divisor-based classification of integers motivated by recreational mathematics. A number is defined to be patterned if at least one of its positive divisors appears as a digit in its base-10…

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

Given a map $\varphi:\mathbb{P}^1\rightarrow \mathbb{P}^1$ of degree greater than 1 defined over a number field $k$, one can define a map $\varphi_\mathfrak{p}:\mathbb{P}^1(\mathfrak{o}_k/\mathfrak{p})\rightarrow…

We pursue the study of families of functions on the natural numbers, with emphasis here on the bounded families. The situation being more complicated than the unbounded case, we attack the problem by classifying the families according to…

We investigate solutions to the functional equation $f(f(x)) = e^x$, which can be interpreted as the problem of finding a half iterate of the exponential map. While no elementary solution exists, we construct and analyze non-elementary…

For each of the functions $f \in \{\phi, \sigma, \omega, \tau\}$ and every natural number $k$, we show that there are infinitely many solutions to the inequalities $f(p_n-1) < f(p_{n+1}-1) < \dots < f(p_{n+k}-1)$, and similarly for…

We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general.…

This paper introduces a new class of iterated function systems (IFSs) called R-IFSs, which include both rotation/reflection maps and contraction maps. The study of R-IFSs is motivated by the recent research direction on enriching IFSs by…

We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…

We study the iterative behavior of the family of 3-step linear fractional recurrences and the family of birational maps they define. We determine all the possible periodicities within this family or, equivalently, the birational maps of…

Let $\varphi$ be the Euler's function and fix an integer $k\ge 0$. We show that, for every initial value $x_1\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+1}=\varphi(x_n)+k$ for all $n\ge 1$ is eventually…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

We consider iterated function systems on the real line that consist of continuous, piecewise linear functions. We show that typically the natural dimension of these systems changes continuously with respect to the parameters that define the…

Let $G$ be a prolific graph, that is a finite connected simple graph which is not isomorphic to a cycle nor a path nor the star graph $K_{1,3}$. The line-graph of $G$, denoted by $L(G)$, is defined by having its vertex-set equal to the…

Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…