Related papers: Multicorns are not Path Connected

A graph is called {\em arc-transitive} (or {\em symmetric}) if its automorphism group has a single orbit on ordered pairs of adjacent vertices, and 2-arc-transitive its automorphism group has a single orbit on ordered paths of length 2. In…

For any closed surface $S$ of genus $g \geq 2$, we show that the deformation space of marked hyperbolic 3-manifolds homotopy equivalent to $S$, $AH(S \times I)$, is not locally connected. This proves a conjecture of Bromberg who recently…

This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…

The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…

Generic relative immersions of compact one-manifolds in the closed unit disk, i.e. divides, provide a powerful combinatorial framework, and allow a topological construction of fibered classical links, for which the monodromy diffeomorphism…

In earlier papers, we showed a decomposition of 2-diregular digraphs (2-dds) and used it to provide some sufficient conditions for these graphs to be non-Hamiltonian; we also showed a close connection between the permanent and determinant…

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…

In work by Ausoni, Dundas and Rognes a half magnetic monopole is discovered and describes an obstruction to creating a determinant K(ku) \to ku*. In fact it is an obstruction to creating a determinant gerbe map from K(ku) to K(Z,3). We…

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…

A digraph is {\bf \( k \)-linked} if for arbitary two disjoint vertex sets \(\{s_1, \ldots, s_k\}\) and \(\{t_1, \ldots, t_k\}\), there exist vertex-disjoint directed paths \(P_1, \ldots, P_k\) {such that \(P_i\) is a directed path from…

If $n \geq 3$, then moduli space ${\mathcal M}_{0,[n+1]}$, of isomorphisms classes of $(n+1)$-marked spheres, is a complex orbifold of dimension $n-2$. Its branch locus ${\mathcal B}_{0,[n+1]}$ consists of the isomorphism classes of those…

We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is…

This work establishes a structure theorem for compact K\"ahler manifolds with semipositive anticanonical bundle. Up to finite \'etale cover, it is proved that such manifolds split holomorphically and isometrically as a product of Ricci flat…

In this paper, we consider random iterations of polynomial maps $z^2 +c_n$ where $c_n$ are complex-valued independent random variables following the uniform distribution on the closed disk with center $c$ and radius $r$. The aim of this…

For the space of single-variable monic and centered complex polynomial vector fields of arbitrary degree d, it is proved that any bifurcation which preserves the multiplicity of equilibrium points can be realized as a composition of a…

Let $P_n$ denote the undirected path of length $n-1$. The cardinality of the set of congruence classes induced by the graph homomorphisms from $P_n$ onto $P_k$ is determined. This settles an open problem of Michels and Knauer (Disc. Math.,…

We prove the NP-completeness of the integer multiflow problem in planar graphs, with the following restrictions: there are only two demand edges, both lying on the infinite face of the routing graph. This was one of the open challenges…

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

We describe a construction procedure of infinite sets of $2$-links in closed simply connected 4-manifolds that are topologically isotopic, smoothly inequivalent and componentwise topologically unknotted. These 2-links are the first examples…

We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…