THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS

By Matthieu Picantin. 2001

63 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/f33c1394e1bb5f7b650cd9cecd795fd6d3e97611

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Ruth Charney
2. Juan González-Meneses
3. N. Franco
4. J. Birman
5. Tara E. Brendle
6. Benson Farb
7. David Peifer

In Geometry and Topology

1. Juan González-Meneses
2. J. Birman
3. Ruth Charney
4. N. Franco
5. Tara E. Brendle
6. John Meier
7. Matthieu Picantin
8. Kim Whittlesey

In Mathematical Physics

1. Juan González-Meneses
2. J. Birman
3. N. Franco
4. Tara E. Brendle
5. John Meier
6. Ruth Charney
7. Volker Gebhardt
8. David Bessis

Citations in the corpus

• Conjugacy problem for braid groups and Garside groups1 (2001, methodology): “[10, 15] Let a = ∆a1 · · ·al ∈ G be in left normal form.”
• Bestvina's Normal Form Complex and the Homology of Garside Groups (2002, background): “The monoid M = 〈x, y | xyxyx = y〉 is Garside with atomic element ∆ = (yx) = y = (xy) (see §4 in [25]).”
• Braids: A Survey (2004, background): “We also refer the reader to [121] for explicit presentations for the dual monoids associated to the Artin groups of finite type, and also for an interesting table that gives the number of simple elements defined by the left divisors of the Garside element in the classical and dual monoids for the fi”
• The Center of Thin Gaussian Groups (2001, background): “There exist an integer p and an element c′ in M satisfying c = pc′; see [11, 17].”