Skip to content

PositivePermutationBraid ​

The unique positive braid realising a permutation in which no pair of strands crosses more than once.

PositivePermutationBraid(permutation)the positive braid with no pair crossing twice
Typed signatures
TypePackageApplies
(list<integer>) -> expression<Braid>braidalways

Domain: Braids and knots

Examples

Basic #

σ1σ2σ1\sigma_1\sigma_2\sigma_1, the half twist

live ↗
InPositivePermutationBraid([3,2,1])\mathrm{PositivePermutationBraid}(\bigl\lbrack3, 2, 1\bigr\rbrack)OutBraid(3,[1,2,1])\mathrm{Braid}(3, \bigl\lbrack1, 2, 1\bigr\rbrack)

Each pair crosses at most once

live ↗
InPositivePermutationBraid([3,1,2])\mathrm{PositivePermutationBraid}(\bigl\lbrack3, 1, 2\bigr\rbrack)OutBraid(3,[2,1])\mathrm{Braid}(3, \bigl\lbrack2, 1\bigr\rbrack)
About
Examples2

See also: BraidPermutation, LorenzBraid