相关论文: Dynnikov and train track transition matrices of ps…

The Dynnikov coordinate system puts global coordinates on the boundary of Teichm\"uller space of an $n$--punctured disk. We survey the Dynnikov coordinate system, and investigate how we use this coordinate system to study pseudo--Anosov…

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…

We define Dynnikov coordinates on virtual braid groups. We prove that they are faithful invariants of virtual 2-braids, and present evidence that they are also very powerful invariants for general virtual braids.

We study the minimal dilatation of pseudo-Anosov pure surface braids and provide upper and lower bounds as a function of genus and the number of punctures. For a fixed number of punctures, these bounds tend to infinity as the genus does. We…

We generalize Dynnikov coordinate system previosly defined on the standard punctured disk to an orientable surface of genus-1 with n punctures and one boundary component.

The equivalence class of an Agol cycle is a conjugacy invariant of a pseudo-Anosov map. Mosher defined train tracks in the torus associated to Farey intervals and investigated the relation between the train tracks and the continued fraction…

This paper is devoted to the spectral properties of a class of unitary operators with a matrix representation displaying a band structure. Such band matrices appear as monodromy operators in the study of certain quantum dynamical systems.…

We establish a sharp lower bound on the spectral gap of the biased adjacent-transposition Markov chain on the symmetric group. As a consequence, we resolve a longstanding conjecture of Fill, proving that among all regular probability…

We propose to study unitary matrix ensembles defined in terms of unitary stochastic transition matrices associated with Markov processes on graphs. We argue that the spectral statistics of such an ensemble (after ensemble averaging) depends…

We study a certain type of braid closure which resembles the plat closure but has certain advantages; for example, it maps pure braids to knots. The main results of this note are a Markov-type theorem and a description of how Vassiliev…

To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…

In this paper we define a monoid of pseudo braids and prove that this monoid is isomorphic to a singular braid monoid. We also prove an analogue of Markov's theorem for pseudo braids.

We consider the first order periodic systems perturbed by a $2N\ts 2N$ matrix-valued periodic potential on the real line. The spectrum of this operator is absolutely continuous and consists of intervals separated by gaps. We define the…

Let $S_{g,p}$ denote the genus $g$ orientable surface with $p$ punctures. We show that nested train track sequences constitute $O((g,p)^{2})$-quasiconvex subsets of the curve graph, effectivizing a theorem of Masur and Minsky. As a…

In these notes, we present versions of trace theorems for Sobolev spaces over an interval in the real line, and also a one-dimensional version of the well-known Poincare inequality.

We show that the subsurface projection of a train track splitting sequence is an unparameterized quasi-geodesic in the curve complex of the subsurface. For the proof we introduce induced tracks, efficient position, and wide curves. This…

Let $n \ge 2$ be an integer. In this note, we show that the {\it oriented} transition matrices over the field $\mathcal R$ of all real numbers (over the finite field $\mathcal Z_2$ of two elements respectively) of all continuous {\it vertex…

We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…

A simple braid is a positive braid that can be drawn so that any two strands cross at most once. We prove that as $n \to \infty$, the proportion of simple braids on $n$ strands that have positive topological entropy tends toward $100\%$.…

Let $\Sigma$ be a smooth compact connected oriented surface with boundary. A metric on $\Sigma$ is said to be of Anosov type if it has strictly convex boundary, no conjugate points, and a hyperbolic trapped set. We prove that two metrics of…