相关论文: Algorithmic aspects of branched coverings I. Van K…

This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…

We consider "Thurston maps": branched self-coverings of the sphere with ultimately periodic critical points, and prove that the Thurston equivalence problem between them (continuous deformation of maps along with their critical orbits) is…

Thurston maps are branched self-coverings of the sphere whose critical points have finite forward orbits. We give combinatorial and algebraic characterizations of Thurston maps that are isotopic to expanding maps as "Levy-free" maps and as…

As we known, the {\it Seifert-Van Kampen theorem} handles fundamental groups of those topological spaces $X=U\cup V$ for open subsets $U, V\subset X$ such that $U\cap V$ is arcwise connected. In this paper, this theorem is generalized to…

In 1980s, Thurston established a topological characterization theorem for postcritically finite rational maps. In this paper, a decomposition theorem for a class of postcritically infinite branched covering termed `Herman map' is developed.…

Thurston obtained a combinatorial characterization for generic branched self-coverings that preserve the orientation of the oriented 2-sphere by associating a planar graph to them [arXiv:1502.04760]. In this work, the Thurston result is…

In the context of complex algebraic varieties, the decomposition theorem for semi-small maps provides a decomposition of the direct image of the constant sheaf. In this work, we develop a decomposition theorem for branched coverings of…

Let $\tilde f\colon(S^2,\tilde A)\to(S^2,\tilde A)$ be a Thurston map and let $M(\tilde f)$ be its mapping class biset: isotopy classes rel $\tilde A$ of maps obtained by pre- and post-composing $\tilde f$ by the mapping class group of…

Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…

William Thurston (1946-2012) gave a combinatorial characterization for generic branched self-coverings of the two-sphere by associating a planar graph to them 10.48550/arXiv.1502.04760. By generalizing the notion of local balancing, the…

We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…

We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed…

Motivated by the Bruhat and Cartan decompositions of general linear groups over local fields, double cosets of the group of label preserving automorphisms of a label-regular tree over the fixator of an end of the tree and over maximal…

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of…

We generalize the van Kampen theorem for unions of non-connected spaces, due to R. Brown and A. R. Salleh, to the context where families of subspaces of a space B are replaced by a locally sectionable map to B.

The Tree Decomposition Conjecture by Bar\'at and Thomassen states that for every tree $T$ there exists a natural number $k(T)$ such that the following holds: If $G$ is a $k(T)$-edge-connected simple graph with size divisible by the size of…

While motivated by structural problems in mathematical music theory, this article introduces a novel combinatorial framework that advances the classification of cyclic cubic bipartite graphs. We extend the classical study of Levi graphs by…

This research report outlines work, partially joint with Jeremy Kahn and Kevin Pilgrim, which gives parallel theories of elastic graphs and conformal surfaces with boundary. One one hand, this lets us tell when one rubber band network is…

We develop a robust foundation for studying the fundamental group(oid) in discrete homotopy theory, including: equivalent definitions and basic properties, the theory of covering graphs, and the discrete version of the Seifert-van Kampen…

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…