Combinatorial distance between braid words
Group Theory
2009-06-23 v1
Authors:
Patrick Dehornoy
Abstract
We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.
Cite
@article{arxiv.0906.3814,
title = {Combinatorial distance between braid words},
author = {Patrick Dehornoy},
journal= {arXiv preprint arXiv:0906.3814},
year = {2009}
}
Related papers
View all related →
Combinatorics · Mathematics
Enumerations relating braid and commutation classes
Susanna Fishel, Elizabeth Milićević, Rebecca Patrias, Bridget Eileen Tenner
2018-08-06
Information Theory · Computer Science
Lower bounds on the minimum average distance of binary codes
Beniamin Mounits
2007-07-13
Geometric Topology · Mathematics
Braids for pretzel links
A. Del Pozo Manglano, P. M. G. Manchón
2021-01-01
Logic in Computer Science · Computer Science
Constructing Witnesses for Lower Bounds on Behavioural Distances
Ruben Turkenburg, Harsh Beohar, Franck van Breugel, Clemens Kupke +1
2025-10-14
Information Theory · Computer Science
New Upper Bounds on A(n,d)
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
2007-07-13
Combinatorics · Mathematics
A Graph-Matching Formulation of the Interleaving Distance between Merge Trees
Matteo Pegoraro
2024-11-11
Combinatorics · Mathematics
Friendship theorem: A combinatorial proof
Vineeth Chintala
2024-02-13
Formal Languages and Automata Theory · Computer Science
Dyck Words, Lattice Paths, and Abelian Borders
F. Blanchet-Sadri, Kun Chen, Kenneth Hawes
2017-08-23
Logic · Mathematics
Combinatorics of reductions between equivalence relations
Dan Hathaway, Scott Schneider
2014-10-29
Discrete Mathematics · Computer Science
Combinatorial information distance
Joel Ratsaby
2010-10-19
Geometric Topology · Mathematics
Gordian Adjacency for Positive Braid Knots
Tolson H. Bell, David C. Luo, Luke Seaton, Samuel P. Serra
2021-01-12
Information Theory · Computer Science
A note on reducing the computation time for minimum distance and equivalence check of binary linear codes
Nikolay Yankov, Krassimir Enev
2018-09-12
Probability · Mathematics
A lower bound on the probability that a binomial random variable is exceeding its mean
Christos Pelekis, Jan Ramon
2016-04-22
Geometric Topology · Mathematics
A Note on Topologically-Trivial Braids
Orlin Stoytchev
2009-07-15
Combinatorics · Mathematics
A short proof of the existence of designs
Peter Keevash
2024-11-28
Formal Languages and Automata Theory · Computer Science
Remarks on separating words
Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson
2011-03-24
Group Theory · Mathematics
A simple solution to the word problem for virtual braid groups
Paolo Bellingeri, Bruno Aaron Cisneros de La Cruz, Luis Paris
2016-03-07
Combinatorics · Mathematics
On the Hook Length Formula for Binary Trees
William Y. C. Chen, Laura L. M. Yang
2007-05-23
Formal Languages and Automata Theory · Computer Science
Some Results on Digital Segments and Balanced Words
Alessandro De Luca, Gabriele Fici
2024-11-14
Formal Languages and Automata Theory · Computer Science
Length of the Shortest Word in the Intersection of Regular Languages
Thomas Ang, Jeffrey Shallit
2009-10-09
Combinatorics · Mathematics
Diameter of reduced words
Victor Reiner, Yuval Roichman
2020-06-03
Representation Theory · Mathematics
Morphisms between indecomposable complexes in the bounded derived category of a gentle algebra
Kristin Krogh Arnesen, Rosanna Laking, David Pauksztello
2015-01-23
Logic in Computer Science · Computer Science
On the computational complexity of cut-reduction
Klaus Aehlig, Arnold Beckmann
2007-12-11
Dynamical Systems · Mathematics
Minimal subshifts with a language pivot property
Ville Salo
2019-01-16
Group Theory · Mathematics
Reduce Problems From Braid Groups To Braid Monoids
Serge Burckel
2007-09-26