The following pages link to ALGORITHMS FOR POSITIVE BRAIDS (Q4322220):
Displaying 50 items.
- Turning numbers for periodic orbits of disk homeomorphisms (Q360548) (← links)
- Affine braid groups: a better platform than braid groups for cryptology? (Q429773) (← links)
- Twisted conjugacy in braid groups. (Q466083) (← links)
- Algorithmic recognition of quasipositive braids of algebraic length two. (Q479795) (← links)
- A quotient of the Artin braid groups related to crystallographic groups (Q504338) (← links)
- Curve graphs and Garside groups (Q527608) (← links)
- Basic results on braid groups. (Q540762) (← links)
- Periodic elements in Garside groups. (Q635444) (← links)
- Small braids with large ultra summit set. (Q650460) (← links)
- Reducible braids and Garside theory. (Q658401) (← links)
- How to read the length of a braid from its curve diagram. (Q664250) (← links)
- A fast method for comparing braids (Q675872) (← links)
- Groups with a complemented presentation (Q678835) (← links)
- Dual Garside structure and reducibility of braids. (Q713409) (← links)
- Garside groups are strongly translation discrete. (Q875106) (← links)
- Combinatorics of normal sequences of braids (Q878008) (← links)
- On positive braids motivated by Rossler dynamical system (Q900494) (← links)
- Alternating normal forms for braids and locally Garside monoids. (Q942197) (← links)
- A Garside-theoretic approach to the reducibility problem in braid groups. (Q947495) (← links)
- The cyclic sliding operation in Garside groups. (Q966447) (← links)
- Solving the conjugacy problem in Garside groups by cyclic sliding. (Q972844) (← links)
- Translation numbers in a Garside group are rational with uniformly bounded denominators. (Q995629) (← links)
- On the cycling operation in braid groups. (Q1003696) (← links)
- Efficient solutions to the braid isotopy problem. (Q1003697) (← links)
- Towards generating secure keys for braid cryptography (Q1008952) (← links)
- On the inverse braid monoid. (Q1009763) (← links)
- Left-Garside categories, self-distributivity, and braids (Q1034190) (← links)
- A new approach to the word and conjugacy problems in the braid groups (Q1273842) (← links)
- A new algorithm for recognizing the unknot (Q1279535) (← links)
- Band-generator presentation for the 4-braid group (Q1361367) (← links)
- Genera of some closed 4-braids (Q1361368) (← links)
- The wellordering on positive braids (Q1366712) (← links)
- Homology of Gaussian groups. (Q1395346) (← links)
- Conjugacy problem for braid groups and Garside groups. (Q1403868) (← links)
- The fine structure of LD-equivalence (Q1590057) (← links)
- A new algorithm for solving the word problem in braid groups (Q1604340) (← links)
- On the centralizer of generic braids (Q1616919) (← links)
- Maximally writhed real algebraic links (Q1741574) (← links)
- Identifying half-twists using randomized algorithm methods. (Q1864877) (← links)
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups (Q1865128) (← links)
- The \(n\)th root of a braid is unique up to conjugacy. (Q1880607) (← links)
- Computation of centralizers in braid groups and Garside groups. (Q1884037) (← links)
- Braid group actions on left distributive structures, and well orderings in the braid groups (Q1917384) (← links)
- Acylindrical hyperbolicity for Artin groups of dimension \(2\) (Q2071811) (← links)
- Garside theory and subsurfaces: some examples in braid groups (Q2178746) (← links)
- A construction of pseudo-Anosov braids with small normalized entropies (Q2190810) (← links)
- Simple braids (Q2210168) (← links)
- Algorithms for Garside calculus (Q2252115) (← links)
- Closures of positive braids and the Morton-Franks-Williams inequality (Q2252593) (← links)
- Infinite examples of cancellative monoids that do not always have least common multiple. (Q2254962) (← links)