Related papers: The Decoration Theorem for Mandelbrot and Multibro…
Carrots for dessert is the title of a section of the paper `On polynomial-like mappings' by Douady and Hubbard. In that section the authors define a notion of dyadic carrot fields of the Mandelbrot set M and more generally for Mandelbrot…
A decoration of the Mandelbrot set $M$ is a part of $M$ cut off by two external rays landing at some tip of a satellite copy of $M$ attached to the main cardioid. In this paper we consider infinitely renormalizable quadratic polynomials…
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one implies the existence of interior points in the difference…
In this paper the fractional-order Mandelbrot and Julia sets in the sense of $q$-th Caputo-like discrete fractional differences, for $q\in(0,1)$, are introduced and several properties are analytically and numerically studied. Some…
In this paper we prove the following: Take any "small Mandelbrot set" and zoom in a neighborhood of a parabolic or Misiurewicz parameter in it, then we can see a quasiconformal image of a Cantor Julia set which is a perturbation of a…
We give new proofs that the Mandelbrot set is locally connected at every Misiurewicz point and at every point on the boundary of a hyperbolic component. The idea is to show ``shrinking of puzzle pieces'' without using specific puzzles.…
Following the ideas of A.~Douady, we give an alternative proof of the authors' result: for any boundary point $c_0$ of the Mandelbrot set $M$, we can find small quasiconformal copies of $M$ in $M$ that are encaged in nested quasiconformal…
New insights into the combinatorial structure of the Mandelbrot set are given by `Correspondence' and `Translation' Principles both conjectured and partially proved by E. Lau and D. Schleicher. We provide complete proofs of these principles…
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…
A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for…
Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…
A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented…
The Decoration Conjecture describes the structure of the set of braid types of Smale's horseshoe map ordered by forcing, providing information about the order in which periodic orbits can appear when a horseshoe is created. A proof of this…
We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.
We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…
We prove that for every hyperbolic component of the Mandelbrot set, any two limbs with equal denominators are homeomorphic so that the homeomorphism preserves periods of hyperbolic components. This settles a conjecture on the Mandelbrot set…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set separating two vertex sets $X$ and $Y$ is the same as the…
We prove the automorphism conjecture for ordered sets of width less than or equal to 11. The proof supports the meta conjecture that a large number of automorphisms is achievable only as some type of product of independent automorphisms on…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…