Related papers: Attractors of Parikh mapping iterations
Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes the number of occurrences of certain predefined subwords in…
In this paper we investigate how many periodic attractors maps in a small neighbourhood of a given map can have. For this purpose we develop new tools which help to make uniform cross-ratio distortion estimates in a neighbourhood of a map…
The Parikh vector p(s) of a string s is defined as the vector of multiplicities of the characters. Parikh vector q occurs in s if s has a substring t with p(t)=q. We present two novel algorithms for searching for a query q in a text s. One…
We introduce and study a generalized Parikh matrix mapping based on tracking the occurrence counts of special types of subsequences. These matrices retain more information about a word than the original Parikh matrix mapping while…
We use the methods of empirical mathematics to show that iterative logarithmic operations will result in an attractor point on the complex plane. Moreover, we demonstrate that different bases converge onto different attractors. Finally, we…
We introduce the notion of general prints of a word, which is substantialized by certain canonical decompositions, to study repetition in words. These associated decompositions, when applied recursively on a word, result in what we term as…
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…
We study a finite uni-directional array of "cascading" or "threshold coupled" chaotic maps. Such systems have been proposed for use in nonlinear computing and have been applied to classification problems in bioinformatics. We describe some…
We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…
The random map model is a deterministic dynamical system in a finite phase space with n points. The map that establishes the dynamics of the system is constructed by randomly choosing, for every point, another one as being its image. We…
In this paper, we introduce and study the iterates of the following family of functions $\varphi_k$ defined on natural numbers which exhibits nice properties. $$\varphi_k(x)=\left\lbrace \begin{array}{ll} x+k, & \mbox{ if $x$ is prime;}\\…
We use simple equations in order to compare the basins of attraction on the complex plane, corresponding to a large collection of numerical methods, of several order. Two cases are considered, regarding the total number of the roots, which…
Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M-equivalence is proposed as a canonical alternative…
We consider some planar triangular maps. These maps preserve certain fibration of the plane. We assume that there exists an invariant attracting fiber and we study the limit dynamics of those points in the basin of attraction of this…
The focus of this work is the study of Parikh matrices with emphasis on two concrete problems. In the first part of our presentation we show that a conjecture by Dick at al. in 2021 only stands in the case of ternary alphabets, while…
We define and enumerate two new two-parameter permutation families, namely, placements of a maximum number of non-attacking rooks on $k$ chained-together $n\times n$ chessboards, in either a circular or linear configuration. The linear case…
We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a…
We study the topological properties of attractors of Iterated Function Systems (I.F.S.) on the real line, consisting of affine maps of homogeneous contraction ratio. These maps define what we call a second generation I.F.S.: they are…
Our purpose in this paper is (i) to introduce the concept of further generalized hybrid mappings (ii) to introduce the concept of common attractive points (CAP) (iii) to write and use Picard-Mann iterative process for two mappings. We…
For each prime number $p$, the dynamical behavior of the square mapping on the ring $\mathbb{Z}_p$ of $p$-adic integers is studied. For $p=2$, there are only attracting fixed points with their attracting basins. For $p\geq 3$, there are a…