Related papers: Iterates of mappings which are almost continuous a…
We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem…
We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\mathbb N$. These graphs…
Any continuous, transitive, piecewise monotonic map is determined up to a binary choice by its dimension module with the associated finite sequence of generators. The dimension module by itself determines the topological entropy of any…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…
Two-dimensional mappings obtained by coupling two piecewise increasing expanding maps are considered. Their dynamics is described when the coupling parameter increases in the expanding domain. By introducing a coding and by analysing an…
In this paper, we introduce soft continuous mappings which are defined over an initial universe set with a fixed set of parameters. Later we study soft open and soft closed mappings, soft homeomorphism and investigate some properties of…
In this paper, we introduce a generalized piecewise translation map on the Euclidean space. We provide a special case when this map is always of finite type. For a finite type map in this case, we form conjectures on the semi-continuity of…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
We study betweenness preserving mappings (we call them \emph{monotone}) defined on subsets of the plane. Once the domain is a convex set, such a mapping is either the restriction of a homography, or its image is contained in the union of a…
We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking…
It is well known that a continuous piecewise monotone interval map with positive topological entropy is semiconjugate to a map of a constant slope and the same entropy, and if it is additionally transitive then this semiconjugacy is…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
We consider piecewise expanding maps of the interval with finitely many branches of monotonicity and show that they are generically combinatorially stable, i.e., the number of ergodic attractors and their corresponding mixing periods do not…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
The rules in a shape grammar apply in terms of embedding to take advantage of the parts that emerge visually in the appearance of shapes. While the shapes are kept unanalyzed as a computation moves forward, part-structures for shapes can be…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
In this paper we study the structure of the graphs associated with the iterations of the map $x \mapsto x+x^{-1}$ over finite fields of characteristic three.