English
Related papers

Related papers: Algorithmic aspects of branched coverings II/V. Sp…

200 papers

Multiparameter persistent homology has emerged as a powerful generalization of topological data analysis, capable of encoding multivariate filtrations. However, the algebraic complexity of multiparameter persistence modules, marked by wild…

Algebraic Topology · Mathematics 2026-04-14 Mauricio Angel

One way to better understand the smooth mapping class group of the 4-sphere would be to give a list of generators in the form of explicit diffeomorphisms supported in neighborhoods of submanifolds, in analogy with Dehn twists on surfaces.…

Geometric Topology · Mathematics 2025-09-24 David T. Gay

We study vertex-ordering problems in loop-free digraphs subject to constraints on the left-going arcs, focusing on existence conditions and computational complexity. As an intriguing special case, we explore vertex-specific lower and upper…

Combinatorics · Mathematics 2025-09-08 Nóra A. Borsik , Péter Madarasi

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…

Dynamical Systems · Mathematics 2014-08-12 Benjamin Hutz , Adam Towsley

We define two classes of topological infinite degree covering maps modeled on two families of transcendental holomorphic maps. The first, which we call exponential maps of type $(p,q)$, are branched covers and is modeled on transcendental…

Dynamical Systems · Mathematics 2016-03-01 Tao Chen , Yunping Jiang , Linda Keen

Certain classes of 3-manifolds, following Thurston, give rise to a 'skinning map', a self-map of the Teichm\"{u}ller space of the boundary. This paper examines the skinning map of a 3-manifold M, a genus-2 handlebody with two rank-1 cusps.…

Geometric Topology · Mathematics 2012-12-27 Jonah Gaster

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

History and Overview · Mathematics 2024-07-18 Sergey Kurapov , Maxim Davidovsky

The Decomposition Problem in the class $LIP(\mathbb{S}^2)$ is to decompose any bi-Lipschitz map $f:\mathbb{S}^2 \to \mathbb{S}^2$ as a composition of finitely many maps of arbitrarily small isometric distortion. In this paper, we construct…

Metric Geometry · Mathematics 2022-02-11 Alastair N. Fletcher , Vyron Vellis

Based on Morse theory for the energy functional on path spaces we develop a deformation theory for mapping spaces of spheres into orthogonal groups. This is used to show that these mapping spaces are weakly homotopy equivalent, in a stable…

Algebraic Topology · Mathematics 2021-04-14 Jost-Hinrich Eschenburg , Bernhard Hanke

In this paper, we give presentations of the mapping class groups of marked surfaces stabilizing boundaries for any genus. Note that in the existing works, the mapping class groups of marked surfaces were the isotopy classes of…

Geometric Topology · Mathematics 2023-07-31 Jinlei Dong , Fang Li

Based on the action of the mapping class group on the space of measured foliations, we construct a new boundary of the mapping class group and study the structure of this boundary. As an application, for any point in Teichmuller space, we…

Geometric Topology · Mathematics 2023-02-15 Lixin Liu , Yaozhong Shi

Topology is an important determinant of the behavior of a great number of condensed-matter systems, but until recently has played a minor role in elasticity. We develop a theory for the deformations of a class of twisted non-Euclidean…

Soft Condensed Matter · Physics 2025-08-26 Carlos E. Moguel-Lehmer , Christian D. Santangelo

In this paper, we study a flag complex which is naturally associated to the Thurston theory of surface diffeomorphisms for compact connected orientable surfaces with boundary. The various pieces of the Thurston decomposition of a surface…

Geometric Topology · Mathematics 2007-05-23 John D. McCarthy , Athanase Papadopoulos

The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of…

Computational Geometry · Computer Science 2026-04-21 Daniel Kalmanovich , Yaar Solomon

In this paper, we study the dualization in distributive lattices, a generalization of the well-known hypergraph dualization problem. We in particular propose equivalent formulations of the problem in terms of graphs, hypergraphs, and…

Discrete Mathematics · Computer Science 2020-05-26 Oscar Defrain , Lhouari Nourine , Takeaki Uno

In this paper, we study quasi post-critically finite degenerations for rational maps. We construct limits for such degenerations as geometrically finite rational maps on a finite tree of Riemann spheres. We prove the boundedness for such…

Dynamical Systems · Mathematics 2021-12-16 Yusheng Luo

The configuration space of $n$ marked points on the complex plane is considered. We investigate a decomposition of this space by so-called Gauss-skizze i.e. a class of graphs being forests, introduced by Gauss. It is proved that this…

Algebraic Geometry · Mathematics 2020-07-06 N. C. Combe

One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…

Combinatorics · Mathematics 2007-05-23 Peter Mani-Levitska , Sinisa Vrecica , Rade Zivaljevic

A class of topological spaces is topologically rigid if any two spaces with the same fundamental group are also homeomorphic. Topological rigidity, in addition to its intrinsic interest, has been useful for solving abstract commensurability…

Geometric Topology · Mathematics 2023-09-21 Yandi Wu

Many natural computational problems in computer science, mathematics, physics, and other sciences amount to deciding if two objects are equivalent. Often this equivalence is defined in terms of group actions. A natural question is to ask…

Computational Complexity · Computer Science 2025-12-03 Vladimir Lysikov , Michael Walter
‹ Prev 1 4 5 6 7 8 10 Next ›