Related papers: Unicritical and Maximally Critical Laminations

It has been recently discovered that in smooth unfoldings of maps with a rank-one homoclinic tangency there are codimension two laminations of maps with infinitely many sinks. Indeed, these laminations, called Newhouse laminations, occur…

Let $P$ be a polynomial of degree $d$ with a Cremer point $p$ and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets $J_P$. The \emph{red dwarf} $J_P$ are nowhere connected im…

In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a…

One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…

A portrait is a combinatorial model for a discrete dynamical system on a finite set. We study the geometry of portrait moduli spaces, whose points correspond to equivalence classes of point configurations on the affine line for which there…

Some of the most important compartmental systems, such as irreversible catenary, mamillary and circular systems are symbolically simplified by the method of exact linear lumping. A few symbolically unmanageable systems are numerically…

We study Hausdorff limits of the external rays of a given periodic angle along a convergent sequence of polynomials of degree $d \geq 2$ with connected Julia sets.

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

We introduce darning of compact sets (darning and gluing of finite unions of compact sets), which are not thin at any of their points, in a potential-theoretic framework which may be described, analytically, in terms of harmonic…

A completely stable multicurve of a post-critically finite rational map induces a combinatorial decomposition. The projections of the small Julia sets are immersed within the original Julia set. We prove that two small Julia sets are…

We study quasiconformal deformations and mixing properties of hyperbolic sets in the family of holomorphic correspondences z^r +c, where r >1 is rational. Julia sets in this family are projections of Julia sets of holomorphic maps on C^2,…

Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…

Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density…

A transcendental entire function is called criniferous if every point in its escaping set can eventually be connected to infinity by a curve of escaping points. Many transcendental entire functions with bounded singular set have this…

The characteristic polynomials of the adjacency matrix of line graphs of caterpillars and then the characteristic polynomials of their Laplacian or signless Laplacian matrices are characterized, using recursive formulas. Furthermore, the…

Seriation methods order a set of descriptions given some criterion (e.g., unimodality or minimum distance between similarity scores). Seriation is thus inherently a problem of finding the optimal solution among a set of permutations of…

We study the critical points of monomial functions over an algebraic subset of the probability simplex. The number of critical points on the Zariski closure is a topological invariant of that embedded projective variety, known as its…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…

Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…