Related papers: Small braids having a big Ultra Summit Set

We prove that the size of the super summit set of a braid can grow exponentially with the canonical length of the braid, even for pseudo-Anosov braids.

We show that there is a family of pseudo-Anosov braids independently parameterized by the braid index and the (canonical) length whose smallest conjugacy invariant sets grow exponentially in the braid index and linearly in the length and…

We prove that, in the $l$-ball of the Cayley graph of the braid group with $n \geqslant 3$ strands, the proportion of rigid pseudo-Anosov braids is bounded below independently of $l$ by a positive value.

Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…

In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal…

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…

It is well-known that there is a faithful representation of braid groups on automorphism groups of free groups, and it is also well-known that free groups are bi-orderable. We investigate which n-strand braids give rise to automorphisms…

In this work we present a natural surjective map from rigid braids in B_3 (in Garside sense) to SL_2(N). This map provides an upper and a lower bound for the dilatation factor of a pseudo-Anosov 3-strand braid. These bounds only depend on…

This paper concerns a family of pseudo-Anosov braids with dilatations arbitrarily close to one. The associated graph maps and train tracks have stable "star-like" shapes, and the characteristic polynomials of their transition matrices form…

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…

This paper describes a family of pseudo-Anosov braids with small dilatation. The smallest dilatations occurring for braids with 3, 4 and 5 strands appear in this family. A pseudo-Anosov braid with 2g+1 strands determines a hyperelliptic…

Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…

In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a…

We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the…

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\%$.…

In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given…

In this note, we deduce a partial answer to the question in the title. In particular, we show that asymptotically almost all bi-Perron algebraic unit whose characteristic polynomial has degree at most $2n$ do not correspond to dilatations…

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…

It is proved by Sakuma and Brooks that any closed orientable $3$-manifold with a Heegaard splitting of genus $g$ admits a $2$-fold branched cover that is a hyperbolic $3$-manifold and a genus $g$ surface bundle over the circle. This paper…

We present a simple construction which associates to every Garside group a metric space, called the additional length complex, on which the group acts. These spaces share important features with curve complexes: they are…