arXiv research

The study counts curves on a once-punctured torus with self-intersections.

Let $Σ$ be a surface of negative Euler characteristic and $S$ a generating set for $π_1(Σ,p)$ consisting of simple loops that are pairwise disjoint (except at $p$). We show that the word length with respect to $S$ of an element of $π_1(Σ,p)$ is given by its intersection number with a well-chosen collection of curves an…

Each free homotopy class of directed closed curves on a surface with boundary can be described by a cyclic reduced word in the generators of the fundamental group and their inverses. The word length is the number of letters of the cyclic word. If the surface has a hyperbolic metric with geodesic boundary, the geometric…

The study examines conjugation curvature in a specific group, finding elements with various curvatures.

Study shows shorter words for group elements in surface groups and RAAGs.

Estimates growth of reciprocal classes in Hecke groups.

The paper finds formulas for word lengths and conjugacy classes in surface groups.

Clarifies metric properties on group power sets.

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite union of orbits of the automorphism group, and show that the translation length o…

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 find an element f with the property that the minimal subsurface supporting a …

RNA structures show that a significant portion of bases do not form hydrogen bonds.

Study inert and ambiguous classes in modular group using combinatorial methods.

A simple text model shows word lengths follow Zipf's law.

Study explains Zipf's law using geometric mechanisms from a finite alphabet.

For the free group $F_r$ on $r>1$ generators (respectively, the free product $G_1 * G_2$ of two nontrivial finite groups $G_1$ and $G_2$), we obtain the asymptotic for the number of conjugacy classes of commutators in $F_r$ (respectively, $G_1 * G_2$) with a given word length in a fixed set of free generators (respecti…

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it to a range of presentations. Our main focus is on 2-generator 1-relator presenta…

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices in semisimple Lie groups (specifically SL(n,Z) and Sp(2n, Z) to show that a ``ran…

In this article, we propose two algorithms for determining the Nielsen-Thurston classification of a mapping class $ψ$ on a surface $S$. We start with a finite generating set $X$ for the mapping class group and a word $ψ$ in $\langle X \rangle$. We show that if $ψ$ represents a reducible mapping class in $\Mod(S)$ then …

We find a constructive bound for the word length of a generating set for the centralizer of an element of the Mapping Class Group. As a consequence, we show that it is algorithmically decidable whether two postcritically finite branched coverings of the sphere are Thurston equivalent.

For word-equations in groups, we find a logarithmic bound on non-solutions.

We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a reduction system of circles can be found completely if the input is a certain type of r…

We give a solution to the word problem for the singular braid monoid SB_n. The complexity of the algorithm is quadratic in the product of the word length and the number of the singular generators in the word. Furthermore we algebraically reprove a result of Fenn, Keyman and Rourke that the monoid embeds into a group an…

In this paper, we prove a quantitative version of the Tits alternative for negatively pinched manifolds $X$. Precisely, we prove that a nonelementary discrete isometry subgroup of $\mathrm{Isom}(X)$ generated by two non-elliptic isometries $g$, $f$ contains a free subgroup of rank $2$ generated by isometries $f^N , h$ …

We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For example, we can use these geodesics to compute the asymptotic translation length, Ni…

We consider the action of a pseudo-Anosov mapping class on $\mathcal{PML}(S)$. This action has north-south dynamics and so, under iteration, laminations converge exponentially to the stable lamination. We study the rate of this convergence and give examples of families of pseudo-Anosov mapping classes where the rate go…

The study examines the growth of reciprocal classes in Hecke groups, proving an asymptotic formula.

Study self-intersections of arcs on a pair of pants, proving natural number spectrum.

We construct an action of the free group $F_n$ on the homotopy category of projective modules over a finite dimensional zigzag algebra. The main theorem in the paper is that this action is faithful. We describe the relationship between homotopy classes of paths in the punctured disc and complexes of projective zigzag m…

We consider the fundamental group $π$ of a surface of finite type equipped with the infinite generating set consisting of all simple closed curves. We show that every nilpotent quotient of $π$ has finite diameter with respect to the word metric given by this set. This is in contrast with a result of Danny Calegari that…

We give a new, effective proof of the separability of cubically convex-cocompact subgroups of special groups. As a consequence, we show that if $G$ is a virtually compact special hyperbolic group, and $Q\leq G$ is a $K$-quasiconvex subgroup, then any $g\in G-Q$ of word-length at most $n$ is separated from $Q$ by a subg…

Growth rates of geodesics on modular orbifolds are studied.

Consider a hyperbolic group G and a quasiconvex subgroup H of infinite index. We construct a set-theoretic section s of the quotient map (of sets) from G to G/H such that s(G/H) is a net in G; that is, any element of G is a bounded distance from s(G/H). This section arises naturally as a set of points minimizing word-l…

We give various estimates of the minimal number of self-intersections of a nontrivial element of the kth term of the lower central series and derived series of the fundamental group of a surface. As an application, we obtain a new topological proof of the fact that free groups and fundamental groups of closed surfaces …

We study a coarse homology theory with prescribed growth conditions. For a finitely generated group G with the word length metric this homology theory turns out to be related to amenability of G. We characterize vanishing of a certain fundamental class in our homology in terms of an isoperimetric inequality on G and sh…

Study on stable torsion length in groups, showing it vanishes in crystallographic groups and providing algorithms for computation.

Knowledge distillation (KD) is a very popular method for model size reduction. Recently, the technique is exploited for quantized deep neural networks (QDNNs) training as a way to restore the performance sacrificed by word-length reduction. KD, however, employs additional hyper-parameters, such as temperature, coeffici…

The study calculates the growth rate of reciprocal hyperbolic elements in Hecke groups.

We give a quantification of residual finiteness for the fundamental groups of hyperbolic manifolds that admit a totally geodesic immersion to a compact, right-angled Coxeter orbifold of dimension 3 or 4. Specifically, we give explicit upper bounds on residual finiteness that are linear in terms of geodesic length. We t…

Deep neural networks (DNN) are powerful models for many pattern recognition tasks, yet their high computational complexity and memory requirement limit them to applications on high-performance computing platforms. In this paper, we propose a new method to evaluate DNNs trained with 32bit floating point (float32) accura…

We study the word length entropy of automorphisms of residually nilpotent groups, and how the entropy of such group automorphisms relates to the entropy of induced automorphisms on various nilpotent quotients. We show that much like the structure of a nilpotent group is dictated to a large degree by its abelianization,…

Improved bounds on acylindricity for right-angled Artin groups.

Study counts geodesics on modular surface, linking to necklace counting.

Operating deep neural networks (DNNs) on devices with limited resources requires the reduction of their memory as well as computational footprint. Popular reduction methods are network quantization or pruning, which either reduce the word length of the network parameters or remove weights from the network if they are n…

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 is reducible. To do this we use an (ideal) triangulation to obtain a coordinate s…

Given a measure on the Thurston boundary of Teichmueller space, one can pick a geodesic ray joining some basepoint to a randomly chosen point on the boundary. Different choices of measures may yield typical geodesics with different geometric properties. In particular, we consider two families of measures: the ones whic…

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which was left unsolved in both papers was the number m of times one must `cycle' (res…

The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the semidirect product $\mathbb Z\ltimes G^n$ of the infinite cyclic group $\mathbb Z$ and…

Study of Bowditch representations in hyperbolic spaces with implications for dynamics and recognition.