Related papers: Iterative square roots of functions
The square root of Not is a logical operator of importance in quantum computing theory and of interest as a mathematical object in its own right. In physics, it is a square complex matrix of dimension 2. In the present work it is a complex…
Choose a random degree d poly f with coefficients in a finite field F. We estimate the ultimate period of f under compositional iteration. We also determine the joint distribution of the small cycle lengths in the graph with edges (x,f(x)),…
The eigenvalue problem for a linear function L centers on solving the eigen-equation Lx = rx. This paper generalizes the eigenvalue problem from a single linear function to an iterated function system F consisting of possibly an infinite…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
Under suitable asymptotic and convexity conditions on a function $g\colon\mathbb{R}_+\to\mathbb{R}$, the solution to $\Delta f=g$, where $\Delta$ is the forward difference operator, is unique up to an additive constant and is called the…
A classical approach for surface classification is to find a compact algebraic representation for each surface that would be similar for objects within the same class and preserve dissimilarities between classes. We introduce Self…
The main goal of this article is to bring together the theories of holomorphic iteration in the unit disc and semigroups of holomorphic functions. We develop a technique that allows us to partially embed the orbit of a holomorphic self-map…
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…
In this paper we study nonlinear interpolation problems for interpolation and peak-interpolation sets of function algebras. The subject goes back to the classical Rudin-Carleson interpolation theorem. In particular, we prove the following…
We investigate finite and infinite nested square root formulas convergent to unity.
We prove that it is NP-hard to decide whether a graph is the square of a 6-apex graph. This shows that the square root problem is not tractable for squares of sparse graphs (or even graphs from proper minor-closed classes).
An infinite continued composition is an expression of the form \begin{equation*} \lim_{n\to\infty}t_0\circ t_1 \circ t_2 \circ \cdots \circ t_n(c)\;, \end{equation*} where the $t_i$ are maps from a set $D$ to itself, the initial value $c$…
An equation $f(x)=a$, where $f$ is a complex meromorphic function and $a\in\mathbb{C}$ is a parameter, is solvable in elementary functions if the inverse map $x=f^{-1}(a)$ can be expressed as a finite composition of arithmetic operations…
The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…
We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…
This paper is the first paper of three papers in a series, which intend to provide a systematic treatment for the space-filling curves of self-similar sets. In the present paper, we introduce a notion of \emph{linear graph-directed IFS}…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
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…
The paper presents (human-oriented) specification and (pen-and-paper) verification of the square root function. The function implements Newton method and uses a look-up table for initial approximations. Specification is done in terms of…