Combinatorial distance between braid words
Patrick Dehornoy (LMNO)
TL;DR
This paper introduces a straightforward naming approach to determine lower bounds on the combinatorial distance between positive braid words, aiding in understanding their structural differences.
Contribution
It presents a novel, simple naming argument method for establishing lower bounds on the combinatorial distance between braid words.
Findings
Provides a new lower bound technique for braid word distances
Simplifies the process of comparing braid words
Enhances understanding of braid word structure
Abstract
We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · semigroups and automata theory