Related papers: Quadratic Thurston maps with few postcritical poin…

We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…

The classification of one parameter local Coulomb branch solution of theories with eight supercharges is given by assuming that it is given by a genus $g$ fiberation of Riemann surfaces. The crucial point is the fact that certain conjugacy…

Let f: P^1 \to P^1 be a rational map with finite postcritical set P_f. Thurston showed that f induces a holomorphic map \sigma_f of the Teichmueller space T modelled on P_f to itself fixing the basepoint corresponding to the identity map…

There is a family of hyperbolic groups known as hyperbolic hydra which contain heavily distorted free subgroups. We prove the existence of Cannon--Thurston maps (that is, maps of the boundaries induced by subgroup inclusion) for these free…

This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…

This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…

We show that the set of conjugacy classes of cubic polynomials with a prefixed critical point, of preperiod $k\geq 1$, is an irreducible algebraic curve. We also establish an analogous result for quadratic rational maps. We then study a…

In this paper, we construct an algorithm for minimising piecewise smooth functions for which derivative information is not available. The algorithm constructs a pair of quadratic functions, one on each side of the point with smallest known…

We prove the existence of Cannon-Thurston maps for Kleinian groups corresponding to pared manifolds whose boundary is incompressible away from cusps. We also describe the structure of these maps in terms of ending laminations.

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…

As a particular problem within the field of non-autonomous discrete systems, we consider iterations of two quadratic maps $f_{c_0}=z^2+c_0$ and $f_{c_1}=z^2+c_1$, according to a prescribed binary sequence, which we call a \emph{template}.…

We prove that the tree almost automorphism groups admit exactly three commensurability classes of closed commensurated subgroups. Our proof utilizes an independently interesting characterization of subgroups of the tree almost automorphism…

We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…

We extend the concept of a Hubbard tree, well established and useful in the theory of polynomial dynamics, to the dynamics of transcendental entire functions. We show that Hubbard trees in the strict traditional sense, as invariant compact…

Over an algebraically closed field of positive characteristic, there exist rational functions with only one critical point. We give an elementary characterization of these functions in terms of their continued fraction expansions. Then we…

A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…

Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at…

We consider the problem of provably finding a stationary point of a smooth function to be minimized on the variety of bounded-rank matrices. This turns out to be unexpectedly delicate. We trace the difficulty back to a geometric obstacle:…

We introduce a new class of optimal iterative methods without memory for approximating a simple root of a given nonlinear equation. The proposed class uses four function evaluations and one first derivative evaluation per iteration and it…

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…