6533b82ffe1ef96bd12948fa
RESEARCH PRODUCT
A simple algorithm for finding short sigma-definite representatives
Jean FromentinJean FromentinLuis Parissubject
[ MATH.MATH-GR ] Mathematics [math]/Group Theory [math.GR]Braid groupbraid monoids20F3620M0506F05Group Theory (math.GR)02 engineering and technology01 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]Mathematics::Group TheoryMathematics::Category TheoryMathematics::Quantum AlgebraFOS: MathematicsBraidBraid group0101 mathematicsSIMPLE algorithmMathematicsDiscrete mathematicsGenerator (computer programming)algorithmAlgebra and Number Theory010102 general mathematicsSigmaComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)021001 nanoscience & nanotechnologyMathematics::Geometric Topologybraid orderingIndex (publishing)0210 nano-technologyMathematics - Group TheoryWord (computer architecture)description
We describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2010-12-22 | Journal of Algebra |