Serge Burckel

Learn More
Artin’s braid groups Bn (see Birman, 1975, and Garside, 1969) are ordered using left distributive algebras (see Dehornoy, 1994). The restriction of this order to positive braid monoids B n is a well-ordering (see Burckel, 1997, and Laver, 1996). A combinatorial characterization of this well-ordering is based on a representation of braids by trees and(More)
We investigate the computation of mappings from a set S to itself with in situ programs, that is using no extra variables than the input, and performing modifications of one component at a time, hence using no extra memory. In this paper, we survey this problem introduced in previous papers by the authors, we detail its close relation with rearrangeable(More)