Related papers: Isotopies vis-\`a-vis level-preserving embeddings
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
We study basic properties of flow equivalence on one-dimensional compact metric spaces with a particular emphasis on isotopy in the group of (self-) flow equivalences on such a space. In particular, we show that an orbit-preserving such map…
We enhance an isogeny graph of elliptic curves by incorporating level structures defined by bases of the kernels of iterates of the Verschiebung map. We extend several previous results on isogeny graphs with level structures defined by…
Topological entropy is a widely studied indicator of chaos in topological dynamics. Here we give a generalized definition of topological entropy which may be applied to set-valued functions. We demonstrate that some of the well-known…
The topological classification of the inner mappings on the fully invariant regular components of the wandering set with a special attracting boundary up to the topological conjugacy is defined in terms of distinguishing graph. Two inner…
Whether embedding spaces use all their dimensions equally, i.e., whether they are isotropic, has been a recent subject of discussion. Evidence has been accrued both for and against enforcing isotropy in embedding spaces. In the present…
A stratified space is a topological space equipped with a \emph{stratification}, which is a decomposition or partition of the topological space satisfying certain extra conditions. More recently, the notion of poset-stratified space, i.e.,…
We prove the existence of lattice isomorphic line arrangements having $\pi_1$-equivalent or homotopy-equivalent complements and non homeomorphic embeddings in the complex projective plane. We also provide two explicit examples, one is…
We give a characterization of distance--preserving subgraphs of Johnson graphs, i.e. of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph $J(m,\Lambda)$ has the subsets of cardinality $m$ of a set $\Lambda$ as…
Using only continuous partitions of unity, we provide equivalent definitions for the metric, topological and topological tail entropies and pressures of a continuous self-map of a compact set, as well as their conditional versions. A tail…
The chaotical dynamics is studied in different Friedmann-Robertson- Walker cosmological models with scalar (inflaton) field and hydrodynamical matter. The topological entropy is calculated for some particular cases. Suggested scheme can be…
A linear system of difference equations and a nonlinear perturbation are considered, we obtain sufficient conditions to ensure the topological equivalence between them, namely, the linear part satisfies a property of dichotomy on the…
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
In this paper, we prove a theorem about embedding of some partially ordered topological spaces in topological hyperspaces equipped with Fell topology. Then we give some examples to show that the map defining the embedding may not be…
We classify endomorphisms of the plane that preserve a pencil of curves.
In order to better understand and to compare interleavings between persistence modules, we elaborate on the algebraic structure of interleavings in general settings. In particular, we provide a representation-theoretic framework for…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…
A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…