Related papers: The Decoration Theorem for Mandelbrot and Multibro…
We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…
We consider the problem of distortion minimal morphing of $n$-dimensional compact connected oriented smooth manifolds without boundary embedded in $\R^{n+1}$. Distortion involves bending and stretching. In this paper, minimal distortion…
A key point in Douady and Hubbard's study of the Mandelbrot set $M$ is the theorem that every parabolic point $c\ne 1/4$ in $M$ is the landing point for exactly two external rays with angle which are periodic under doubling. This note will…
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$…
In this paper, we prove some uniqueness theorems concerning the derivatives of meromorphic functions when they share three sets. The obtained results improve some recent existing results.
In the context of complex algebraic varieties, the decomposition theorem for semi-small maps provides a decomposition of the direct image of the constant sheaf. In this work, we develop a decomposition theorem for branched coverings of…
For $0<\delta\leq 1$, let $R_k(m;\delta)$ denote the smallest $N$ such that every coloring of $k$-element subsets by two colors yields an $m$-element set $M$ with relative discrepancy $\delta$, which means that one color class has at least…
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the…
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim…
Let $\mathsf{M}$ be the set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that every set is contained in a transitive set. Let…
We prove that any element in a matroid can be removed, by either deletion or contraction, in such a way that no tangle "splits".
In this work, we develop Extraction Theorems for classes of geometric objects with small extraction numbers. These classes include intervals, axis-parallel segments, axis-parallel rays, and octants. We investigate these classes of objects…
There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…
Sets with many additive quadruples are guaranteed to have many additive octuples, by H\"{o}lder's inequality. Sets with not many more than this are said to be additively nonsmoothing. We give a new proof of a structural theorem for…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
The main aim of this article is to give an exposition of the diagrammatic proof due to Boos and Rost of the theorem of Hurwitz that the dimension of a composition algebra is one of 0,1,2,4,8.
In the theory of hyperplane arrangements, the most important and difficult problem is the combinatorial dependency of several properties. In this atricle, we prove that Terao's celebrated addition-deletion theorem for free arrangements is…
In this Note, we present recent developments in the Renormalization Theory of quadratic polynomials and discuss their applications, with an emphasis on the MLC conjecture, the problem of local connectivity of the Mandelbrot set, and on its…