ﻻ يوجد ملخص باللغة العربية
In 1985, Barnsley and Harrington defined a ``Mandelbrot Set $mathcal{M}$ for pairs of similarities --- this is the set of complex numbers $z$ with $0<|z|<1$ for which the limit set of the semigroup generated by the similarities $x mapsto zx$ and $x mapsto z(x-1)+1$ is connected. Equivalently, $mathcal{M}$ is the closure of the set of roots of polynomials with coefficients in $lbrace -1,0,1 rbrace$. Barnsley and Harrington already noted the (numerically apparent) existence of infinitely many small ``holes in $mathcal{M}$, and conjectured that these holes were genuine. These holes are very interesting, since they are ``exotic components of the space of (2 generator) Schottky semigroups. The existence of at least one hole was rigorously confirmed by Bandt in 2002, and he conjectured that the interior points are dense away from the real axis. We introduce the technique of traps to construct and certify interior points of $mathcal{M}$, and use them to prove Bandts Conjecture. Furthermore, our techniques let us certify the existence of infinitely many holes in $mathcal{M}$.
We give for the first time a detailed proof of the Palamodovs total instability conjecture in Lagrangian dynamics. This proves an older related Lyapunov instability conjecture posed by Lyapunov and Arnold and reduces the Lagrange-Dirichlet converse p
The global attractor conjecture says that toric dynamical systems (i.e., a class of polynomial dynamical systems on the positive orthant) have a globally attracting point within each positive linear invariant subspace -- or, equivalently, complex bal
Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.
A typical decomposition question asks whether the edges of some graph $G$ can be partitioned into disjoint copies of another graph $H$. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the decomposition of
We prove that if the set of unordered pairs of real numbers is colored by finitely many colors, there is a set of reals homeomorphic to the rationals whose pairs have at most two colors. Our proof uses large cardinals and it verifies a conjecture of