English
Related papers

Related papers: The Decoration Theorem for Mandelbrot and Multibro…

200 papers

We provide a simple proof of the existence of a planar separator by showing that it is an easy consequence of the circle packing theorem. We also reprove other results on separators, including: (A) There is a simple cycle separator if the…

Computational Geometry · Computer Science 2025-10-07 Sariel Har-Peled

This is a survey paper about the fractal percolation process, also known as Mandelbrot percolation. It is intended to give a general breadth overview of more recent research in the topic, but also includes some of the more classical…

Probability · Mathematics 2025-08-12 István Kolossváry , Sascha Troscheit

We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…

Combinatorics · Mathematics 2017-12-13 João Paulo Costalonga

Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…

Geometric Topology · Mathematics 2018-04-30 Harrison Chapman

By means of a graphical journey across the Mandelbrot set for the classic quadratic iterator $f(z):z^2+q$, we illustrate how connectivity breaks as the seed $z_0$ is no longer at the critical point of $f(z)$. Finally we suggest an attack to…

History and Overview · Mathematics 2007-06-13 Alessandro Rosa

We prove a Bonnet theorem for isometric immersions of submanifolds into the products of an arbitrary number of simply connected real space forms. Then, we prove the existence of associated families of minimal surfaces in such products.…

Differential Geometry · Mathematics 2015-02-12 Marie-Amélie Lawn , Julien Roth

We give a framework to study the connectedness of the set of zeros of power series with coefficients in a finite subset $G\subset \mathbb{C}$. We prove that the set of zeros in the unit disk is connected and locally connected if some graph…

Dynamical Systems · Mathematics 2023-07-25 Yuto Nakajima

When specialized to the context of permutations, Schmerl and Trotter's Theorem states that every simple permutation which is not a parallel alternation contains a simple permutation with one fewer entry. We give an elementary proof of this…

Combinatorics · Mathematics 2014-09-17 Robert Brignall , Vincent Vatter

We prove a tangle-tree theorem and a tangle duality theorem for abstract separation systems $\vec S$ that are submodular in the structural sense that, for every pair of oriented separations, $\vec S$ contains either their meet or their join…

Combinatorics · Mathematics 2019-04-25 Reinhard Diestel , Joshua Erde , Daniel Weißauer

We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…

K-Theory and Homology · Mathematics 2020-01-28 Boris Goldfarb , Jonathan L. Grossman

We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.

Combinatorics · Mathematics 2016-07-08 Sven Schäge

We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…

Functional Analysis · Mathematics 2013-01-08 Marek Cúth

It is proved that if we partition a $d$-dimensional cube into $n^d$ small cubes and color the small cubes into $m+1$ colors then there exists a monochromatic connected component consisting of at least $f(d, m) n^{d-m}$ small cubes.

Combinatorics · Mathematics 2013-08-23 Roman Karasev

We prove that a group obtained as a quotient of the free product of finitely many cubulable groups by a finite set of relators satisfying the classical $C'(1/6)$--small cancellation condition is cubulable. This yields a new large class of…

Group Theory · Mathematics 2015-12-24 Alexandre Martin , Markus Steenbock

Given a weak model set in a locally compact Abelian, group we construct a relatively dense set of common Bragg peaks for all its subsets that have non-trivial Bragg spectrum. Next, we construct a relatively dense set of common norm almost…

Functional Analysis · Mathematics 2023-10-27 Nicolae Strungaru

Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…

Combinatorics · Mathematics 2018-12-11 William T. Trotter , Bartosz Walczak , Ruidong Wang

We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…

Number Theory · Mathematics 2026-04-29 Yifan Jing , Akshat Mudgal

Enochs' conjecture asserts that each covering class of modules (over any fixed ring) has to be closed under direct limits. Although various special cases of the conjecture have been verified, the conjecture remains open in its full…

Rings and Algebras · Mathematics 2021-11-11 Jan Šaroch

It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…

Combinatorics · Mathematics 2018-10-02 A. Skopenkov

A model for the Mandelbrot set is due to Thurston and is stated in the language of geodesic laminations. The conjecture that the Mandelbrot set is actually homeomorphic to this model is equivalent to the celebrated MLC conjecture stating…

Dynamical Systems · Mathematics 2015-03-03 Alexander Blokh , Lex Oversteegen , Ross Ptacek , Vladlen Timorin
‹ Prev 1 4 5 6 7 8 10 Next ›