Related papers: Quadratic-time computations for pseudo-Anosov mapp…
We explicitly construct pseudo-Anosov maps on the closed surface of genus $g$ with orientable foliations whose stretch factor $\lambda$ is a Salem number with algebraic degree $2g$. Using this result, we show that there is a pseudo-Anosov…
The motivation for this paper is to justify a remark of Thurston that the algebraic degree of stretch factors of pseudo-Anosov maps on a surface $S$ can be as high as the dimension of the Teichm\"uller space of $S$. In addition to proving…
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…
In 1974, Thurston proved that, up to isotopy, every automorphism of closed orientable surface is either periodic, reducible, or pseudo-Anosov. The latter case has lead to a rich theory with applications ranging from dynamical systems to low…
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 determine the smallest stretch factor among pseudo-Anosov maps with an orientable invariant foliation on the closed nonorientable surfaces of genus 4, 5, 6, 7, 8, 10, 12, 14, 16, 18 and 20. We also determine the smallest stretch factor…
We introduce a construction of pseudo-Anosov homeomorphisms on n-times punctured spheres and surfaces with higher genus using only sufficiently many positive half-twists. These constructions can produce explicit examples of pseudo-Anosov…
We describe an algorithm which, given two essential curves on a surface $S$, computes their distance in the curve graph of $S$, up to multiplicative and additive errors. As an application, we present an algorithm to decide the…
For a fixed marked surface $S$, we construct polynomial bounds on the periodic and preperiodic lengths of the maximal splitting sequences of a projectively invariant measured train track. We give two consequences of these bounds. Firstly,…
Several algorithms are presented for the accurate computation of the leaves in the foliation of an ODE near a hyperbolic fixed point. They are variations of a contraction mapping method in [25] to compute inertial manifolds, which…
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…
The Teichmueller polynomial of a fibered 3-manifold plays a useful role in the construction of mapping class having small stretch factor. We provide an algorithm that computes this polynomial of the fibered face associated to a…
Factorization of matrices where the rank of the two factors diverges linearly with their sizes has many applications in diverse areas such as unsupervised representation learning, dictionary learning or sparse coding. We consider a setting…
We propose an approach to determine the continual progression of algorithmic efficiency, as an alternative to standard calculations of time complexity, likely, but not exclusively, when dealing with data structures with unknown maximum…
In this paper, we solve a maximization problem where the objective function is quadratic and the constraints set is the reachable values set of a stable discrete-time affine system. This problem is equivalent to solve an infinite number of…
Stochastic time-varying optimization is an integral part of learning in which the shape of the function changes over time in a non-deterministic manner. This paper considers multiple models of stochastic time variation and analyzes the…
Counting the independent sets of a graph is a classical #P-complete problem, even in the bipartite case. We give an exponential-time approximation scheme for this problem which is faster than the best known algorithm for the exact problem.…
This document is a practical guide to computations using an automatic structure for the mapping class group of a once-punctured, oriented surface $S$. We describe a quadratic time algorithm for the word problem in this group, which can be…
We study optimization problems that are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity assumptions. Specifically, we focus on Maximum Independent…
We establish moment estimates for the invariant measure of a stochastic partial differential equation describing motion by mean curvature flow in (1+1) dimension, leading to polynomial stability of the associated Markov semigroup. We also…