Related papers: Algorithmic aspects of branched coverings

We give a motivated introduction to the theory of perverse sheaves, culminating in the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber. A goal of this survey is to show how the theory develops naturally from classical…

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…

Thurston obtained a classification of individual surface homeomorphisms via the dynamics of the corresponding mapping class elements on Teichm\"uller space. In this paper we present certain extended versions of this, first, to random…

We introduce topological definitions of expansivity, shadowing, and chain recurrence for homeomorphisms. They generalize the usual definitions for metric spaces. We prove various theorems about topologically Anosov homeomorphisms (maps that…

Tree decompositions were developed by Robertson and Seymour. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to…

We give a generalization of Thurston's Bounded Image Theorem for skinning maps, which applies to pared 3-manifolds with incompressible boundary that are not necessarily acylindrical. Along the way we study properties of divergent sequences…

The work that consists of two parts is devoted to the problem of enumerating unrooted $r$-regular maps on the torus up to all its symmetries. We begin with enumerating near-$r$-regular rooted maps on the torus, projective plane and the…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded…

This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…

Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale…

We prove that there exists an algorithm for determining whether two piecewise-linear spatial graphs are isomorphic. In its most general form, our theorem applies to spatial graphs furnished with vertex colorings, edge colorings and/or edge…

When is a topological branched self-cover of the sphere equivalent to a rational map on CP^1? William Thurston gave one answer in 1982, giving a negative criterion (an obstruction to a map being rational). We give a complementary, positive…

Thurston's fibered face theory allows us to partition the set of pseudo-Anosov mapping classes on different compact oriented surfaces into subclasses with related dynamical behavior. This is done via a correspondence between the rational…

We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…

We provide a complete combinatorial classification of critically fixed anti-Thurston maps, i.e., orientation-reversing branched covers of the 2-sphere that fix every critical point. The first step in the proof, and an interesting result in…

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…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

Finite-sheeted covering mappings onto compact connected groups are studied. It is shown that a finite-sheeted covering mapping from a connected Hausdorff topological space onto a compact connected abelian group G must be a homeomorphism…

The quest for regular models of arithmetic surfaces allows different viewpoints and approaches: using valuations or a covering by charts. In this article, we sketch both approaches and then show in a concrete example, how surprisingly…