English
Related papers

Related papers: Multicorns are not Path Connected

200 papers

In this article, for degree $d\geq 1$, we construct an embedding $\Phi_d $ of the connectedness locus $\mathcal{M}_{d+1}$ of the polynomials $z^{d+1}+c$ into the connectedness locus of degree $2d+1$ bicritical odd polynomials.

Dynamical Systems · Mathematics 2022-09-26 Malavika Mukundan

The classic result by Fortune, Hopcroft, and Wyllie [TCS~'80] states that the directed disjoint paths problem is NP-complete even for two pairs of terminals. Extending this well-known result, we show that the directed disjoint paths problem…

Discrete Mathematics · Computer Science 2025-07-17 Matthias Bentert , Dario Cavallaro , Amelie Heindl , Ken-ichi Kawarabayashi , Stephan Kreutzer , Johannes Schröder

We study the bifurcation loci of quadratic (and unicritical) polynomials and exponential maps. We outline a proof that the exponential bifurcation locus is connected; this is an analog to Douady and Hubbard's celebrated theorem that (the…

Dynamical Systems · Mathematics 2009-01-21 Lasse Rempe , Dierk Schleicher

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…

Combinatorics · Mathematics 2019-09-30 Hoa Thi Bui , Guillermo Pineda-Villavicencio , Julien Ugon

We study path-connectedness and homotopy groups of sets of tensors defined by tensor rank, border rank, multilinear rank, as well as their symmetric counterparts for symmetric tensors. We show that over $\mathbb{C}$, the set of rank-$r$…

Algebraic Geometry · Mathematics 2018-04-24 Pierre Comon , Lek-Heng Lim , Yang Qi , Ke Ye

In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will generalize this result and prove that polyhedra with at most three 3-cuts are hamiltonian. In 2002 Jackson and Yu have shown this result for…

Combinatorics · Mathematics 2018-06-05 Gunnar Brinkmann , Carol T. Zamfirescu

Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an…

Discrete Mathematics · Computer Science 2014-06-23 Raquel Águeda , Valentin Borozan , Marina Groshaus , Yannis Manoussakis , Gervais Mendy , Leandro Montero

A \textit{multicurve} $\C$ on a closed orientable surface is defined to be a finite collection of disjoint non-isotopic essential simple closed curves. The Dehn twist $t_{\C}$ about $\C$ is the product of the Dehn twists about the…

Geometric Topology · Mathematics 2015-06-05 Kashyap Rajeevsarathy , Prahlad Vaidyanathan

The characteristic varieties of a space are the jump loci for homology of rank 1 local systems. The way in which the geometry of these varieties may vary with the characteristic of the ground field is reflected in the homology of finite…

Algebraic Geometry · Mathematics 2014-06-13 Graham Denham , Alexander I. Suciu

The multicritical point at which both a 3-component and a 2-component order parameters order simultaneously in 3 dimensions is shown to have the critical behavior of the decoupled fixed point, with separate n=3 and n=2 behavior. This…

Statistical Mechanics · Physics 2009-11-07 Amnon Aharony

We prove that if a directed multigraph $D$ has at most $t$ pairwise arc-disjoint directed triangles, then there exists a set of less than $2t$ arcs in $D$ which meets all directed triangles in $D$, except in the trivial case $t=0$. This…

Combinatorics · Mathematics 2019-03-11 Jessica McDonald , Gregory J. Puleo , Craig Tennenhouse

We give an algorithm with complexity $O(f(R)^{k^2} k^3 n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian. Here, $f$ is a polynomial function, $n = |V(G)|$, $k = |E(H)|$ and…

Discrete Mathematics · Computer Science 2010-08-24 Guyslain Naves

In this paper we study the topology of three different kinds of spaces associated to polynomial knots of degree at most $d$, for $d\geq2$. We denote these spaces by $\mathcal{O}_d$, $\mathcal{P}_d$ and $\mathcal{Q}_d$. For $d\geq3$, we show…

Geometric Topology · Mathematics 2021-01-05 Hitesh Raundal , Rama Mishra

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

Geometric Topology · Mathematics 2021-04-16 Michael Dougherty , Jon McCammond

We define the Milnor number -- as the intersection number of two holomorphic sections -- of a one-dimensional holomorphic foliation $\mathscr{F}$ with respect to a compact connected component $C$ of its singular set. Under certain…

Complex Variables · Mathematics 2023-02-10 Arturo Fernández-Pérez , Gilcione Nonato Costa , Rudy Rosas

In this paper we give the bifurcation diagram of the family of cubic vector fields $\dot z=z^3+ \epsilon_1z+\epsilon_0$ for $z\in \mathbb{C}\mathbb{P}^1$, depending on the values of $\epsilon_1,\epsilon_0\in\mathbb{C}$. The bifurcation…

Dynamical Systems · Mathematics 2015-06-24 Christiane Rousseau

We study the dynamics of template iterations, consisting of arbitrary compositions of functions chosen from a finite set of polynomials. In particular, we focus on templates using complex unicritical maps in the family $\{ z^d + c, c \in…

Dynamical Systems · Mathematics 2022-06-09 Mark Comerford , Anca Radulescu , Kieran Cavanagh

We solve the longstanding conjecture by Milnor (1993) concerning the connectedness locus $M_1$ of the family of quadratic rational maps tangent to the identity at $\infty$. We prove that this locus in homeomorphic to the Mandelbrot set $M$…

Dynamical Systems · Mathematics 2024-04-12 Carsten Lunde Petersen , Pascale Roesch

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…

Combinatorics · Mathematics 2023-10-13 Hoa T. Bui , Guillermo Pineda-Villavicencio , Julien Ugon

Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is…

Algebraic Geometry · Mathematics 2022-04-05 Saugata Basu , Daniel Perrucci