Related papers: Wandering continua for rational maps

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.

We prove that a meromorphic map defined on the complement of a compact subset of a three-dimensional Stein manifold M and with values in a compact complex three-fold X extends to the complement of a finite set of points. If X is simply…

It is proved that flatness of an analytic mapping germ from a complete intersection is determined by its sufficiently high jet. As a consequence, one obtains finite determinacy of complete intersections. It is also shown that flatness and…

We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…

Le Roux and Ziegler asked whether every simply connected compact nonempty planar co-c.e. closed set always contains a computable point. In this paper, we solve the problem of le Roux and Ziegler by showing that there exists a contractible…

We show that, up to minor-equivalence, the Farey graph is the unique minor-minimal graph that is infinitely edge-connected but such that every two vertices can be finitely separated.

We show that a continuous map $f$ from a quasi-graph $G$ to itself is pointwise recurrent if and only if one of the following two statements holds: (1) $X$ is a simple closed curve and $f$ is topologically conjugate to an irrational…

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

The Smith embedding of a finite planar map with two marked vertices, possibly with conductances on the edges, is a way of representing the map as a tiling of a finite cylinder by rectangles. In this embedding, each edge of the planar map…

The paper studies the relation between a nonlinear time-varying flat discrete-time system and the corresponding linear time-varying systems which are obtained by a linearization along trajectories. It is motivated by the continuous-time…

The tent map is an elementary example of an interval map possessing many interesting properties, such as dense periodicity, exactness, Lipschitzness and a kind of length-expansiveness. It is often used in constructions of dynamical systems…

We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…

We show that each refinable map preserves colocal connectedness of the domain while a proximately refinable map does not necessarily. Also, we prove that colocal connectedness is a Whitney property and is not a Whitney reversible property.

Linear relations, defined as submodules of the direct sum of two modules, can be viewed as objects that carry dynamical information and reflect the inherent uncertainty of sampled dynamics. These objects also provide an algebraic structure…

We call a function $f: X\to Y$ $P$-preserving if, for every subspace $A \subset X$ with property $P$, its image $f(A)$ also has property $P$. Of course, all continuous maps are both compactness- and connectedness-preserving and the natural…

The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…

We give a rational form of a generic two-dimensional "quad" map, containing the so-called $Q_4$ case, but whose coefficients are free. Its integrability is proved using the calculation of algebraic entropy.

A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…

We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph $G$ is accessible if and only if its set of separations of finite order is an ${\rm Aut}(G)$-finitely…

We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…