Related papers: Multicorns are not Path Connected
An analytic classification of generic anti-polynomial vector fields $\dot z = \overline{P(z)}$ is given in term of a topological and an analytic invariants. The number of generic strata in the parameter space is counted for each degree of…
A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local…
Existence, stability and dynamics of soliton complexes, centered at the site of a single transverse link connecting two parallel 2D (two-dimensional) lattices, are investigated. The system with the on-site cubic self-focusing nonlinearity…
The main result of this paper is that the identity component of the automorphism group of a compact, connected, strictly pseudoconvex CR manifold is compact unless the manifold is CR equivalent to the standard sphere. In dimensions greater…
An $n$-plat 1-knot is one isotopic to the plat closure of some $2n$-braid, which is also called an $n$-bridge 1-knot. Schubert classified 2-bridge 1-knots by considering their double branched covers which are homeomorphic to lens spaces. A…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
It is shown that every connected, bounded domain of holomorphy in ${\mathbb{C}}^n$, $n\geq 2$, has connected boundary.
Let f be a polynomial over the complex numbers with an isolated singularity at 0. We show that the multiplicity and the log canonical threshold of f at 0 are invariants of the link of f viewed as a contact submanifold of the sphere. This is…
We show the existence of polynomial maps which have a regular bifurcation value, while over a neighbourhood of this value the fibres are connected and diffeomorphic.
We consider a 2-valued non-deterministic connective $\wedge \hskip-5.5pt \vee$ defined by the table resulting from the entry-wise union of the tables of conjunction and disjunction. Being half conjunction and half disjunction we named it…
We establish connectedness criteria for graphs associated to monomials in certain quotients of the mod 2 dual Steenrod algebra. We also investigate questions about trees and Hamilton cycles in the context of these graphs. Finally, we…
It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…
Given a directed graph D = (N, A) and a sequence of positive integers 1 <= c_1 < c_2 < ... < c_m <= |N|, we consider those path and cycle polytopes that are defined as the convex hulls of simple paths and cycles of D of cardinality c_p for…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
We prove that Multicut in directed graphs, parameterized by the size of the cutset, is W[1]-hard and hence unlikely to be fixed-parameter tractable even if restricted to instances with only four terminal pairs. This negative result almost…
We prove combinatorial rigidity of infinitely renormalizable unicritical polynomials, P_c :z \mapsto z^d+c, with complex c, under the a priori bounds and a certain "combinatorial condition". This implies the local connectivity of the…
Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…
In this work we study the homotopy type of multipath complexes of bidirectional path graphs and polygons, motivated by works of Vre\'cica and \v{Z}ivaljevi\'c on cycle-free chessboard complexes (that is, multipath complexes of complete…
We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we characterize all graphs which have the property that their…
We exhibit products of Mandelbrot sets in the two-dimensional complex parameter space of cubic polynomials. These products were observed by J. Milnor in computer experiments which inspired Lavaurs' proof of non local-connectivity for the…