Related papers: Attractors of Parikh mapping iterations

We introduce numbers depending on three parameters which we call skyscraper numbers. We discuss properties of these numbers and their relationship with Stirling numbers of the first kind, and we also introduce a skyscraper sequence.

Improving a result of K\'arolyi, Pach and T\'oth, we construct an arrangement of $n$ segments in the plane with at most $n^{\log{8} / \log{169}}$ pairwise crossing or pairwise disjoint segments. We use the recursive method based on…

A primitive $k$-batch code encodes a string $x$ of length $n$ into string $y$ of length $N$, such that each multiset of $k$ symbols from $x$ has $k$ mutually disjoint recovering sets from $y$. We develop new explicit and random coding…

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

A study of rational maps of the real or complex projective plane of degree two or more, concentrating on those which map an elliptic curve onto itself, necessarily by an expanding map. We describe relatively simple examples with a rich…

This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the…

This article studies the number of ways of selecting $k$ objects arranged in $p$ circles of sizes $n_1,\ldots,n_p$ such that no two selected ones have less than $s$ objects between them. If $n_i\geq sk+1$ for all $1\leq i \leq p$, this…

Extending Wigner's theorem we give a characterization of positive maps of $B(H)$ into itself which map the set of rank k projections onto itself.

We study the distribution and the popularity of some patterns in $k$-ary faro words, i.e. words over the alphabet $\{1, 2, \ldots, k\}$ obtained by interlacing the letters of two nondecreasing words of lengths differing by at most one. We…

We consider the problem of enumerating the permutations containing exactly $k$ occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an…

A non-autonomous flow system is introduced with an attractor of Plykin type that may serve as a base for elaboration of real systems and devices demonstrating the structurally stable chaotic dynamics. The starting point is a map on a…

In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated…

Let $f(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. The order of magnitude of $f(n,P_k)$, where $P_k$ is a path on $k$ vertices, is $n^{{\lfloor{\frac{k-1}{2}}\rfloor}+1}$. In this paper we determine the…

We investigate the rate of convergence of the iterates of an n-dimensional quasiregular mapping within the basin of attraction of a fixed point of high local index. A key tool is a refinement of a result that gives bounds on the distortion…

In this paper the attractors synthesis algorithm for a class of dissipative dynamical systems with hyperbolic equilibria, presented in [1], is applied to generate any attractor of the Rikitake system. By switching periodically, or even…

A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…

A chaotic attractor is usually characterised by its multifractal spectrum which gives a geometric measure of its complexity. Here we present a characterisation using a minimal set of independant parameters which are uniquely determined by…

We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…

A set of non-negative integers is an additive basis with range $n$, if its sumset covers all consecutive integers from 0 to $n$, but not $n+1$. If the range is exactly twice the largest element of the basis, the basis is restricted.…

We consider a practical top-k route search problem: given a collection of points of interest (POIs) with rated features and traveling costs between POIs, a user wants to find k routes from a source to a destination and limited in a cost…