Related papers: Iterates of mappings which are almost continuous a…
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist…
Let $(X,\|.\|)$ be a Banach space. Let $C$ be a nonempty, bounded, closed, and convex subset of $X$ and $T: C \rightarrow C$ be a $G$-monotone nonexpansive mapping. In this work, it is shown that the Mann iteration sequence defined by…
We establish arithmetical properties and provide essential bounds for bi-sequences of approximation coefficients associated with the natural extension of maps, leading to continued fraction-like expansions. These maps are realized as the…
We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…
We study the connectedness locus $\mathcal{N}$ for the family of iterated function systems of pairs of homogeneous affine-linear maps in the plane. We prove this set is regular closed (i.e., it is the closure of its interior) away from the…
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
The article is devoted to a structure of topological spaces related with topological quasigroups. Regular and complete spaces over topological quasigroups are studied. Separations and embeddings are also investigated for them. Their…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We show that a random walk on the mapping class group of an orientable surface of finite type makes linear progress in the relative metric, which is quasi-isometric to the complex of curves.
In this paper, the theory of harmonic maps is extended. The soliton or traveling wave solutions of Euler's equations of the extended harmonic maps are studied. In certain cases, the chaotic behaviors of these partial equations can be found…
The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of…
We consider a dynamical system given by an area-preserving map on a two-dimensional phase plane and consider a one-dimensional line of initial conditions within this plane. We record the number of iterates it takes a trajectory to escape…
The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…
This is a survey of topological properties of open, complete nonpositively curved manifolds which may have infinite volume. Topics include topology of ends, restrictions on the fundamental group, as well as a review of known examples.
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…
We study the homotopy theory of diagrams of chain complexes over a field indexed by a finite poset, and show that it can be completely described in terms of appropriate diagrams of graded vector spaces.
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…