相关论文: The pseudo-Anosov and conjugacy problems are in $\…

An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…

The conjugacy problem for the pseudo-Anosov automorphisms of a compact surface is studied. To each pseudo-Anosov automorphism f, we assign an AF-algebra A(f) (an operator algebra). It is proved that the assignment is functorial, i.e. every…

Given two automorphisms of a group $G$, one is interested in knowing whether they are conjugate in the automorphism group of $G$, or in the abstract commensurator of $G$, and how these two properties may differ. When $G$ is the fundamental…

For a fixed marked surface $S$, we show that the problem of deciding whether or not a mapping class is reducible lies in $\textbf{NP}$. As usual this immediately gives an exponential time algorithm to decide whether or not a mapping class…

Given any connected compact orientable surface, a pair of mapping classes are said to be procongruently conjugate if they induce a conjugate pair of outer automophisms on the profinite completion of the fundamental group of the surface. For…

This note gives a brief survey of the minimum dilatation problem for pseudo-Anosov mapping classes, and the first explicit train track description of an infinite family of pseudo-Anosov mapping classes with orientable stable foliations and…

We study types of mapping classes which arise as a product of a given mapping class and powers of certain pure mapping classes. We derive an explicit constant depending only on a surface such that almost all above pure mapping classes give…

We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite…

This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…

We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…

Given any generating set of any pseudo-Anosov-containing subgroup of the mapping class group of a surface, we construct a pseudo-Anosov with word length bounded by a constant depending only on the surface. More generally, in any subgroup G…

We consider the pseudo-Anosov elements of the mapping class group of a surface of genus g that fix a rank k subgroup of the first homology of the surface. We show that the smallest entropy among these is comparable to (k+1)/g. This…

We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…

We show that Galois conjugates of stretch factors of pseudo-Anosov mapping classes arising from Penner's construction lie off the unit circle. As a consequence, we show that for all but a few exceptional surfaces, there are examples of…

We continue with the ideas of Bonatti-Langevin-Jeandenans towards a constructive and algorithmic classification of pseudo-Anosov homeomorphisms (possibly with spines), up to topological conjugacy. We begin by indicating how to assign to…

We investigate the structure of the characteristic polynomial det(xI-T) of a transition matrix T that is associated to a train track representative of a pseudo-Anosov map [F] acting on a surface. As a result we obtain three new polynomial…

In this project, we develop a new connection between the dynamics of quadratic polynomials on the complex plane and the dynamics of homeomorphisms of surfaces. In particular, given a quadratic polynomial, we investigate whether one can…

Wajnryb proved that the mapping class group of a closed oriented surface is generated by two elements. We proved that the mapping class group is generated by two pseudo-Anosov elements. In particular, if the genus is greater than or equal…

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

We consider polynomial differential equations and make a number of contributions to the questions of (i) complexity of deciding stability, (ii) existence of polynomial Lyapunov functions, and (iii) existence of sum of squares (sos) Lyapunov…