Related papers: Attractors of Parikh mapping iterations
A graph is k-choosable if it can be colored whenever every vertex has a list of at least k available colors. We prove that if cycles of length at most four in a planar graph G are pairwise far apart, then G is 3-choosable. This is analogous…
For every pattern $p$ over the alphabet $\{x,y,x^R,y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable.
In this paper we present a uniform way to derive families of maps from the corresponding differential equations describing systems which experience periodic kicks. The families depend on a single parameter - the order of a differential…
We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation $\pi$ to be $k$-pass…
We show that there exist real quadratic maps of the interval whose attractors are computationally intractable. This is the first known class of such natural examples.
In this paper, we describe minimal string attractors of prefixes of simple Parry sequences. These sequences form a coding of distances between consecutive $\beta$-integers in numeration systems with a real base $\beta$. Simple Parry…
In this paper, we use elementary method to give a classification of the multiplicative maps on matrix algebra $M_{n}(\mF)$ over a field $\mF$ of characteristic $0$. All the multiplicative maps are classified into three classes: the trivial…
A $3$-dimensional polytope $P$ is $k$-equiprojective when the projection of $P$ along any line that is not parallel to a facet of $P$ is a polygon with $k$ vertices. In 1968, Geoffrey Shephard asked for a description of all equiprojective…
For fractals on Riemannian manifolds, the theory of iterated function systems often does not apply well directly, as fractal sets are often defined by relations that are multivalued or non-contractive. To overcome this difficulty, we…
In this paper, we focus on ordered $k$-flaw preference sets. Let $\mathcal{OP}_{n,\geq k}$ denote the set of ordered preference sets of length $n$ with at least $k$ flaws and $\mathcal{S}_{n,k}=\{(x_1,...,x_{n-k})\mid x_1+x_2+...…
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and total size 2^{O(k^2 log n)}, i.e., polynomial for all fixed k…
The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of…
A system of N unidimensional global coupled maps (GCM), which support multiattractors is studied. We analize the phase diagram and some special features of the transitions (volume ratios and characteristic exponents), by controlling the…
We are interested in attracting sets of $\mathbb{P}^k(\mathbb{C})$ which are of small topological degree and of codimension $1.$ We first show that there exists a large family of examples. Then we study their ergodic and pluripotential…
We classify the measure theoretic attractors of general C^3 unimodal maps with quadratic critical points. The main ingredient is the decay of geometry.
We recently described a specific type of attractors of two-dimensional discontinuous piecewise linear maps, characterized by two discontinuity lines dividing the phase plane into three partitions, related to economic applications. To our…
In a previous paper we considered a sequence of maps on a complete metric space $(X,d)$ and derived an extension of the Banach fixed point theorem. We showed that backward trajectories of maps $X\to X$ converge under mild conditions and…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…
The Newton-Raphson basins of attraction, associated with the libration points (attractors), are revealed in the generalized Hill problem. The parametric variation of the position and the linear stability of the equilibrium points is…
An account is given of the features, of the kind pertaining to q-statistics, of the dynamics at the one-dimensional critical attractors associated to the three familiar routes to chaos, intermittency, period doubling and quasiperiodicity.…