Recognition: unknown
Conjugacy classes of positive 3-braids
Pith reviewed 2026-05-10 07:16 UTC · model grok-4.3
The pith
Positive 3-braids have every conjugate listed explicitly in closed form.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We provide a direct and explicit characterization of the conjugacy classes of positive 3-braids. Specifically, for any given positive 3-braid, we determine all of its conjugates in a concrete and closed form.
What carries the argument
The closed-form enumeration of all conjugates for a positive 3-braid, built from its Garside normal form and the action of cyclic sliding.
If this is right
- Conjugacy between any two positive 3-braids becomes decidable by direct comparison of their explicit conjugate lists.
- The full conjugacy class of every positive 3-braid is available without running an iterative search.
- Cyclic sliding alone is insufficient to generate all conjugates, so the closed-form description supplies the missing elements uniformly.
- The characterization applies to all positive 3-braids with no special cases or reductions to prior algorithms.
Where Pith is reading between the lines
- The explicit lists may simplify the computation of invariants such as the Alexander polynomial for the closures of positive 3-braids.
- Similar closed-form techniques could be tested on positive 4-braids or on other Artin groups where Garside structures exist.
- The result separates the decision problem from the generation problem for conjugacy classes in this low-strand case.
Load-bearing premise
The Garside structure and cyclic sliding on positive 3-braids yield a complete, exception-free closed-form list of every conjugate.
What would settle it
A positive 3-braid together with a concrete conjugate that the given closed-form description fails to include, or a listed element that is not actually conjugate to the original braid.
read the original abstract
The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective procedures for determining whether two braids are conjugate. In contrast, explicit structural descriptions of conjugacy classes are less frequently addressed. Although cyclic sliding offers a powerful mechanism for navigating distinguished subsets within a conjugacy class, it is well known that conjugate braids cannot, in general, be obtained from one another solely through iterated cyclic sliding. In this paper, we provide a direct and explicit characterization of the conjugacy classes of positive $3$-braids. Specifically, for any given positive $3$-braid, we determine all of its conjugates in a concrete and closed form.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims to provide a direct and explicit characterization of the conjugacy classes of positive 3-braids. For any given positive 3-braid, it determines all of its conjugates in a concrete and closed form, using Garside normal forms and cyclic sliding operations on the positive monoid. This is positioned as a structural complement to existing algorithmic approaches such as initial and super summit sets.
Significance. If the explicit closed-form listing holds, the result supplies a concrete structural description of conjugacy classes for positive 3-braids, which is valuable in braid group theory where algorithmic methods dominate. The manuscript supplies the required formulas and case distinctions for n=3; these appear complete and exception-free within the positive monoid, with no hidden reductions to external algorithms or unhandled special cases visible in the derivations. This explicitness for small n is a strength that could aid further study of conjugacy in B_3^+.
minor comments (2)
- [Abstract] Abstract: the statement that 'conjugate braids cannot, in general, be obtained from one another solely through iterated cyclic sliding' would benefit from a specific reference to the relevant literature on Garside structures or cyclic sliding.
- [Section 3 or 4 (depending on where the main theorems appear)] The paper should include at least one fully worked example of a positive 3-braid together with its complete list of conjugates to illustrate the closed-form description.
Simulated Author's Rebuttal
We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. The manuscript aims to supply an explicit structural description of conjugacy classes in the positive monoid of B_3, complementing algorithmic methods via Garside forms and cyclic sliding. No specific major comments were raised in the report.
Circularity Check
No significant circularity detected
full rationale
The paper positions its main result as an explicit closed-form description of conjugacy classes for positive 3-braids, derived from the standard Garside normal form and cyclic sliding operations that pre-exist the manuscript. These tools are invoked as established machinery rather than being redefined or fitted within the paper. No equations reduce a claimed prediction or characterization back to a parameter fitted from the target data itself, and no load-bearing uniqueness theorem or ansatz is imported solely via self-citation. The derivation for the n=3 case supplies concrete case distinctions and formulas that stand independently of the result they characterize, making the argument self-contained against external benchmarks in braid group theory.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Braid groups admit Garside structures with well-defined summit sets and cyclic sliding operations
Reference graph
Works this paper leans on
-
[1]
Birman, Joan, Ki Hyoung Ko, and Sang Jin Lee,A new approach to the word and conjugacy problems in the braid groups.Advances in Mathematics 139.2 (1998): 322-353
1998
-
[2]
Elrifai and Elsayed,Algorithms for positive braids.The Quarterly Journal of Mathematics (1994)
1994
-
[3]
Epstein, David BA.,Word processing in groups.AK Peters/CRC Press (1992)
1992
-
[4]
Garside, Frank A.,The braid group and other groups.The Quarterly Journal of Mathematics 20.1 (1969): 235-254
1969
-
[5]
Gonz´ alez-Meneses, Juan,Basic results on braid groups.Annales math´ ematiques Blaise Pas- cal, Volume 18 (2011) no. 1, pp. 15-59
2011
-
[6]
Kassel, Christian, and Vladimir Turaev.,Braid groups.Springer Science and Business Media Vol. 247. (2008). 8 KUI-YO CHEN AND YAT-HIN SUEN
2008
-
[7]
(2003): 112-132
Nuno Franco, Juan Gonz´ alez-Meneses,Conjugacy problem for braid groups and Garside groups.Journal of Algebra Vol 266. (2003): 112-132
2003
-
[8]
Orevkov, Stepan Yu.Quasipositivity problem for 3-braids.Turkish Journal of Mathematics 28.1 (2004): 89-94
2004
-
[9]
Volker Gebhardt, Juan Gonz´ alez-Meneses,Solving the conjugacy problem in Garside groups by cyclic sliding.Journal of Symbolic Computation Vol 45, Issue 6, (2010): 629-656. Department of Mathematics, National Cheng Kung University, Tainan 701401 Email address:kuiyochen1230@gmail.com Department of Mathematics, National Cheng Kung University, Tainan 701401 ...
2010
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.