Related papers: Thurston equivalence for rational maps with cluste…
For any integers $d\ge 3$ and $n\ge 1$, we construct a hyperbolic rational map of degree $d$ such that it has $n$ cycles of the connected components of its Julia set except single points and Jordan curves.
We study hierarchical clusterings of metric spaces that change over time. This is a natural geometric primitive for the analysis of dynamic data sets. Specifically, we introduce and study the problem of finding a temporally coherent…
According to the Thurston No Wandering Triangle Theorem, a branching point in a locally connected quadratic Julia set is either preperiodic or precritical. Blokh and Oversteegen proved that this theorem does not hold for higher degree Julia…
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…
Recent work of Dylan Thurston gives a condition for when a post-critically finite branched self-cover of the sphere is equivalent to a rational map. We apply D. Thurston's positive criterion for rationality to give a new proof of a theorem…
We study classes of strata of differentials with fixed spin parity in the Chow ring of moduli spaces of curves. We show that these classes are tautological and computable. Furthermore, we establish the refined DR cycle formula for these…
We classify elements of a cluster modular group into three types. We characterize them in terms of fixed point property of the action on the tropical compactifications associated with the corresponding cluster ensemble. The characterization…
We investigate the family of marked Thurston maps that are defined everywhere on the topological sphere $S^2$, potentially excluding at most countable closed set of essential singularities. We show that when an unmarked Thurston map $f$ is…
We study the cluster combinatorics of $d-$cluster tilting objects in $d-$cluster categories. By using mutations of maximal rigid objects in $d-$cluster categories which are defined similarly for $d-$cluster tilting objects, we prove the…
We find a constructive bound for the word length of a generating set for the centralizer of an element of the Mapping Class Group. As a consequence, we show that it is algorithmically decidable whether two postcritically finite branched…
We give a proof of the fact tha the subset of the rational curves form a closed analytic subset in the space of the 1-dimensional cycles of a complex space.
In this paper we consider maps on the plane which are similar to quadratic maps in that they are degree 2 branched covers of the plane. In fact, consider for $\alpha$ fixed, maps $f_c$ which have the following form (in polar coordinates):…
We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…
The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first…
Cluster analysis requires many decisions: the clustering method and the implied reference model, the number of clusters and, often, several hyper-parameters and algorithms' tunings. In practice, one produces several partitions, and a final…
We prove a refinement of the Fatou-Shishikura Inequality - that the total count of nonrepelling cycles of a rational map is less than or equal to the number of independent infinite forward critical orbits - from a suitable application of…
We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…
Building on work of Doyle and Hyde on polynomial maps in one variable, we produce for each odd integer $d \geq 2$ a H\'enon map of degree $d$ defined over $\mathbb{Q}$ with at least $(d-4)^2$ integral periodic points. This provides a…
We study canonical decompositions of postcritically finite branched coverings of the 2-sphere, as defined by K.~Pilgrim. We show that every hyperbolic cycle in the decomposition does not have a Thurston obstruction. It is thus Thurston…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…