Related papers: Some theorems on colocally connected continua

We prove some theorems on decomposable continua. In particular, we prove; (i) the property of being a Wilder continuum is not a Whitney reversible property, (ii) inverse limits of D**-continua with surjective monotone upper semi-continuous…

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…

Let $U$ be a multiply connected domain of the Riemann sphere $\hat{C}$ whose complement $\hat{C}\setminus U$ has $N<\infty$ components. We show that every conformal map on $U$ can be written as a composition of $N$ maps conformal on simply…

Attractor-repeller decompositions of isolated invariant sets give rise to so-called connecting homomorphisms. These homomorphisms reveal information on the existence and structure of connecting trajectories of the underlying dynamical…

The Riemann Theorem states, that for any nontrivial connected and simply connected domain on the Riemann sphere there exists some its conformal bijection to the exterior of the unit disk. In this paper we find an explicit form of this map…

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…

In this article we consider area preserving diffeomorphisms of planar domains, and we are interested in their conformal points, i.e., points at which the derivative is a similarity. We present some conditions that guarantee existence of…

In this paper we analyze the problem of the geodesic connectedness of subsets of Riemannian manifolds. By using variational methods, the geodesic connectedness of open domains (whose boundaries can be not differentiable and not convex) of a…

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…

We develop Conley's theory for multivalued maps on finite topological spaces. More precisely, for discrete-time dynamical systems generated by the iteration of a multivalued map which satisfies appropriate regularity conditions, we…

Using Conley theory we show that local attractors remain (past) attractors under small non-autonomous perturbations. In particular, the attractors of the perturbed systems will have positive invariant neighborhoods and converge upper…

We prove that the moduli stack of all reduced $n$-pointed curves is ``closely connected" in characteristic zero, in the sense that each irreducible component of the stack intersects the component of smoothable curves. We achieve this by…

We prove some new properties of fidelity (transition probability) and concurrence, the latter defined by straightforward extension of Wootters notation. Choose a conjugation and consider the dependence of fidelity or of concurrence on…

We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…

The Conley index theory is a powerful topological tool for describing the basic structure of dynamical systems. One important feature of this theory is the attractor-repeller decomposition of isolated invariant sets. In this decomposition,…

It is proved that any one-to-one edge map f from a 3-connected graph G onto a graph H, G and H possibly infinite, satisfying f(C) is a circuit in H whenever C is a circuit in G is induced by a vertex isomorphism. This generalizes a result…

We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to $\mathsf{ACA}_0$ over $\mathsf{RCA}_0$. The…

By looking at decidable quotients, a sufficient condition is provided to guarantee that (1) the full subcategory of decidable objects of a topos is an exponential ideal and that (2) the classical notion of connectedness for an object $X$…