Related papers: The Thurston Algorithm for quadratic matings

Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…

Given a polynomial or a rational map f we associate to it a space of maps. We introduce local coordinates in this space, which are essentially the set of critical values of the map. Then we consider an arbitrary periodic orbit of f with…

This work explores fundamental modeling and algorithmic issues arising in the well-established MapReduce framework. First, we formally specify a computational model for MapReduce which captures the functional flavor of the paradigm by…

We prove an explicit characterization of the points in Thurston's Master Teapot. This description can be implemented algorithmically to test whether a point in $\mathbb{C} \times \mathbb{R}$ belongs to the complement of the Master Teapot.…

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

In this article we provide a combinatorial sufficient (and conjecturally, necessary) condition (called $\alpha$-symmetry) for the mating of two postcritically finite polynomials in $\mathcal{S}_1$ to be obstructed. To do this, we study the…

Kaltofen has proposed a new approach in [Kaltofen 1992] for computing matrix determinants. The algorithm is based on a baby steps/giant steps construction of Krylov subspaces, and computes the determinant as the constant term of a…

There has recently been considerable interest in completing a low-rank matrix or tensor given only a small fraction (or few linear combinations) of its entries. Related approaches have found considerable success in the area of recommender…

The aims of this paper are to answer several conjectures and questions about multiplier spectrum of rational maps and to give new proofs of several rigidity theorems in complex dynamics, by combining tools from complex and non-archimedean…

We propose a new functional analytic approach to Stein's method of exchangeable pairs that does not require the pair at hand to satisfy any approximate linear regression property. We make use of this theory in order to derive abstract…

If $p : Y \to X$ is an unramified covering map between two compact oriented surfaces of genus at least two, then it is proved that the embedding map, corresponding to $p$, from the Teichm\"uller space ${\cal T}(X)$, for $X$, to ${\cal…

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as…

The combinatorial Mandelbrot set is a continuum in the plane, whose boundary can be defined, up to a homeomorphism, as the quotient space of the unit circle by an explicit equivalence relation. This equivalence relation was described by…

Expanding Thurston maps form a class of branched covering maps on the topological $2$-sphere $S^{2}$, which are topological models of some non-uniformly expanding rational maps without any smoothness or holomorphicity assumption initially…

We introduce a new fundamental algorithm called Matrix-POAFD to solve the matrix least square problem. The method is based on the matching pursuit principle. The method directly extracts, among the given features as column vectors of the…

Landry, Minsky and Taylor [LMT] introduced two polynomial invariants of veering triangulations -- the taut polynomial and the veering polynomial. We give algorithms to compute these invariants. In their definition [LMT] use only the upper…

A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…

An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…

New algorithms are proposed for the Tucker approximation of a 3-tensor, that access it using only the tensor-by-vector-by-vector multiplication subroutine. In the matrix case, Krylov methods are methods of choice to approximate the dominant…