Knot Atlas - User contributions [en]

Braid Representatives

2009-05-27T09:02:06Z

LaracBocze:

[http://s1.shard.jp/galeach/new77.html imdex asia 2005
] [http://s1.shard.jp/olharder/automatic-watch.html automobile hand control
] [http://s1.shard.jp/bireba/linux-antivirus.html housecalls antivirus free scan
] [http://s1.shard.jp/galeach/new100.html periungual telangiectasia
] [http://s1.shard.jp/galeach/new98.html akedemi fantasia tour
] [http://s1.shard.jp/galeach/new89.html asian face girl
] [http://s1.shard.jp/galeach/new12.html asia europe map
] [http://s1.shard.jp/frhorton/7fqgy22i2.html durban south africa pictures
] [http://s1.shard.jp/losaul/australian-vets.html conversion of euros to australian dollars
] [http://s1.shard.jp/olharder/general-motor.html auto trader for alberta
] [http://s1.shard.jp/losaul/centacare-australia.html vip card australia
] [http://s1.shard.jp/galeach/new41.html asian pga tour golf
] [http://s1.shard.jp/olharder/bxautozip.html auto market shares
] [http://s1.shard.jp/frhorton/y8fj1syi7.html 2006 african cup nation
] [http://s1.shard.jp/olharder/autoroll-654.html links] [http://s1.shard.jp/frhorton/hs3lzrck3.html south africa rugby team nickname] [http://s1.shard.jp/bireba/symantec-antivirus.html symantec antivirus corporate edition 10.1 0.394
] [http://s1.shard.jp/bireba/norotn-antivirus.html norotn antivirus 2005] [http://s1.shard.jp/losaul/murrays-buses.html australia computer used
] [http://s1.shard.jp/galeach/new173.html asian gang shooting
] [http://s1.shard.jp/bireba/alerta-antiviruses.html manually uninstall symantec antivirus corporate edition
] [http://s1.shard.jp/olharder/wes-finch-auto-plaza.html automatic shut off valve
] [http://s1.shard.jp/frhorton/hzioyx6wv.html prom hair style african american woman
] [http://s1.shard.jp/losaul/cruises-from-australia.html australian it job site
] [http://s1.shard.jp/losaul/the-association.html australian briens eucalyptus o oil
] [http://s1.shard.jp/galeach/new47.html asian man white women
] [http://s1.shard.jp/losaul/helicopters-australia.html australia general information
] [http://s1.shard.jp/bireba/the-symantec-antivirus.html antivirus virus definition update
] [http://s1.shard.jp/olharder/automotive-detailing.html auto consumer guide
] [http://s1.shard.jp/olharder/montana-auto-shipping.html kidney disease autoimmune
] [http://s1.shard.jp/losaul/australia-uranium.html paragliding australia
] [http://s1.shard.jp/galeach/new21.html stereotype caucasian
] [http://s1.shard.jp/bireba/clam-win-antivirus.html clam win antivirus] [http://s1.shard.jp/olharder/autoroll-654.html page] [http://s1.shard.jp/bireba/symantec-antivirus.html winantivirus.com
] [http://s1.shard.jp/galeach/new15.html tight and asian 6] [http://s1.shard.jp/bireba/download-free.html uninstall norton antivirus corporate
] [http://s1.shard.jp/losaul/australian-capital.html christian psychology degree australia
] [http://s1.shard.jp/olharder/autoroll-654.html site] [http://s1.shard.jp/olharder/autoroll-654.html domain] [http://s1.shard.jp/losaul/multiplex-group.html cronulla beach australia day
] [http://s1.shard.jp/bireba/avg-antivirus.html norton antivirus updates 2005
] [http://s1.shard.jp/losaul/school-camps.html australian daylight saving dates
] [http://s1.shard.jp/olharder/autoridad-nacional.html auto coverage farmer insurance online proof
] [http://s1.shard.jp/frhorton/q5ck3w5jf.html johannesburg south africa news
] [http://s1.shard.jp/frhorton/ african american migration experience
] [http://s1.shard.jp/frhorton/lmi1tnyfh.html africa mask
] [http://s1.shard.jp/galeach/new192.html asian bookie odds
]
[http://s1.shard.jp/galeach/new162.html asianbabecams password
] [http://s1.shard.jp/frhorton/2beniqaav.html africa aids effects in
] [http://s1.shard.jp/olharder/autoroll-654.html links] [http://s1.shard.jp/olharder/auto-bill-fitts.html mustang autoparts
] [http://s1.shard.jp/galeach/ asia east map north
] [http://s1.shard.jp/galeach/new90.html why did the asian tsunami happen
] [http://s1.shard.jp/losaul/australian-residency.html australia fiji island map
] [http://s1.shard.jp/olharder/bxautozip.html auto lender loan private title
] [http://s1.shard.jp/olharder/1-autobiography.html the autonomic nervous system chart
] [http://s1.shard.jp/olharder/bank-auto-repos.html wire wheels auto
] [http://s1.shard.jp/losaul/why-do-we-have.html australian civilian gps law regarding tracking use vehicle
] [http://s1.shard.jp/losaul/australian-cricket.html adelaide australia day celebrations
] [http://s1.shard.jp/olharder/auto-buy-com.html grand theft auto vice city money cheat
] [http://s1.shard.jp/galeach/new183.html asian groove.com
] [http://s1.shard.jp/losaul/scoutsaustralia.html scouts+australia] [http://s1.shard.jp/bireba/avg-60-antivirus.html norton antivirus symantec help
] [http://s1.shard.jp/galeach/new159.html tartan video asian extreme
] [http://s1.shard.jp/olharder/autoroll-654.html map] [http://s1.shard.jp/frhorton/hzioyx6wv.html prom hair style african american woman
] [http://s1.shard.jp/bireba/symantec-antivirus.html portable antivirus software
] [http://s1.shard.jp/losaul/cheap-air-fare-to.html australian postcodes victoria
] [http://s1.shard.jp/galeach/new129.html south asian networking association sana
] [http://s1.shard.jp/olharder/autoroll-654.html map] [http://s1.shard.jp/frhorton/rlw3nqlyf.html african flag pictures
] [http://s1.shard.jp/losaul/moosehead-beer.html care australia jobs
] [http://s1.shard.jp/frhorton/iyc9ldho5.html recent inventions by african americans
] [http://s1.shard.jp/galeach/new97.html asian nud
] [http://s1.shard.jp/galeach/new48.html southasian tsunami
] [http://s1.shard.jp/galeach/new21.html asian elephants information
] [http://s1.shard.jp/olharder/the-autobiography.html automobile loans rates
] [http://s1.shard.jp/olharder/autoroll-654.html http] [http://s1.shard.jp/olharder/automobile-computer.html concessionnaires auto
] [http://s1.shard.jp/olharder/the-home-auto.html auto part number cross reference
] [http://s1.shard.jp/losaul/open-source-software.html used printing machinery australia
] [http://s1.shard.jp/olharder/autoroll-654.html url] [http://s1.shard.jp/bireba/downloads-antivirus.html ez trust ez antivirus
] [http://s1.shard.jp/olharder/luggage-rack-automobile.html autologous cell transplantation
] [http://s1.shard.jp/galeach/new169.html is euthanasia right
] [http://s1.shard.jp/frhorton/pr9rl67ra.html centurion lake hotel south africa
] [http://s1.shard.jp/frhorton/lr43ii5kv.html african newspaper south] [http://s1.shard.jp/losaul/seasonal-weather.html seasonal weather in australia] [http://s1.shard.jp/frhorton/nluldpiwy.html african caterers
] [http://s1.shard.jp/losaul/holiday-accommodation.html meterology bureau australia
] [http://s1.shard.jp/olharder/subasta-de-autos.html auto visor mirror
] [http://s1.shard.jp/olharder/autoroll-654.html url] [http://s1.shard.jp/frhorton/ african cichlid fish sale
] [http://s1.shard.jp/frhorton/xntk9qgnd.html african american coloring books
] [http://s1.shard.jp/bireba/symantec-antivirus.html symantec antivirus corporate edition 10 x] [http://s1.shard.jp/frhorton/ndbzagarh.html african masks com
] [http://s1.shard.jp/olharder/concession-auto.html reo automobiles
]
http://www.textraccazelere.com
http://www.textaccnabo.com
{{Manual TOC Sidebar}}

Every knot and every link is the closure of a braid. <code>KnotTheory`</code> can also represent knots and links as braid closures:

{{Startup Note}}



{{HelpAndAbout|
n = 1 |
n1 = 2 |
in = <nowiki>BR</nowiki> |
out= <nowiki>BR stands for Braid Representative. BR[k,l] represents a braid on k strands with crossings l={i1,i2,...}, where a positive index i within the list l indicates a right-handed crossing between strand number i and strand number i+1 and a negative i indicates a left handed crossing between strands numbers |i| and |i|+1. Each ij can also be a list of non-adjacent (i.e., commuting) indices. BR also acts as a "type caster": BR[K] will return a braid whose closure is K if K is given in any format that KnotTheory` understands. BR[K] where K is is a named knot with up to 10 crossings returns a minimum braid representative for that knot.</nowiki> |
about= <nowiki>The minimum braids representing the knots with up to 10 crossings were provided by Thomas Gittings. See his article on the subject at arXiv:math.GT/0401051. Vogel's algorithm was implemented by Dan Carney in the summer of 2005 at the University of Toronto.</nowiki>}}




{{HelpLine|
n = 3 |
in = <nowiki>Mirror</nowiki> |
out= <nowiki>Mirror[br] return the mirror braid of br.</nowiki>}}


Thus for example,



{{In|
n = 4 |
in = <nowiki>br1 = BR[2, {-1, -1, -1}];</nowiki>}}




{{InOut|
n = 5 |
in = <nowiki>PD[br1]</nowiki> |
out= <nowiki>PD[X[6, 3, 1, 4], X[4, 1, 5, 2], X[2, 5, 3, 6]]</nowiki>}}




{{InOut|
n = 6 |
in = <nowiki>Jones[br1][q]</nowiki> |
out= <nowiki> -4 -3 1
-q + q + -
q</nowiki>}}




{{InOut|
n = 7 |
in = <nowiki>Mirror[br1]</nowiki> |
out= <nowiki>BR[2, {1, 1, 1}]</nowiki>}}


{{Knot Image Pair|T(5,4)|jpg|K11a362|gif}}

<code>KnotTheory`</code> has the braid representatives of some knots and links pre-loaded, and for all other knots and links it will find a braid representative using Vogel's algorithm. Thus for example,



{{InOut|
n = 8 |
in = <nowiki>BR[TorusKnot[5, 4]]</nowiki> |
out= <nowiki>BR[4, {1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3}]</nowiki>}}




{{InOut|
n = 9 |
in = <nowiki>BR[Knot[11, Alternating, 362]]</nowiki> |
out= <nowiki>BR[10, {1, 2, -3, -4, 5, 6, 5, 4, 3, -2, -1, -4, 3, -2, -4, 3, 5, 4,

-6, 7, -6, 5, 8, 7, 6, 5, -4, -3, 2, 5, -6, 9, -8, 7, -6, 5, 4, -3,

5, 6, 5, 4, 5, -7, 8, -7, 6, 5, -9, -8, -7}]</nowiki>}}


(As we see, Vogel's algorithm sometimes produces scary results. A 51-crossings braid representative for an 11-crossing knot, in the case of [[K11a362]]).

{{Knot Image Pair|10_1|gif|5_2|gif}}

The ''minimum braid representative'' of a given knot is a braid representative for that knot which has a minimal number of braid crossings and within those braid representatives with a minimal number of braid crossings, it has a minimal number of strands (full details are in {{ref|Gittings}}). Thomas Gittings kindly provided us the minimum braid representatives for all knots with up to 10 crossings. Thus for example, the minimum braid representative for the knot [[10_1]] has length (number of crossings) 13 and width 6 (number of strands, also see [[Invariants from Braid Theory]]):



{{InOut|
n = 10 |
in = <nowiki>br2 = BR[Knot[10, 1]]</nowiki> |
out= <nowiki>BR[6, {-1, -1, -2, 1, -2, -3, 2, -3, -4, 3, 5, -4, 5}]</nowiki>}}




{{Graphics|
n = 12 |
in = <nowiki>Show[BraidPlot[CollapseBraid[br2]]]</nowiki> |
img= Braid_Representatives_Out_11.gif |
out= <nowiki>-Graphics-</nowiki>}}


Already for the knot [[5_2]] the minimum braid is shorter than the braid produced by Vogel's algorithm. Indeed, the minimum braid is



{{Graphics|
n = 14 |
in = <nowiki>Show[BraidPlot[CollapseBraid[BR[Knot[5, 2]]]]]</nowiki> |
img= Braid_Representatives_Out_13.gif |
out= <nowiki>-Graphics-</nowiki>}}


To force <code>KnotTheory`</code> to run Vogel's algorithm on [[5_2]], we first convert it to its <code>PD</code> form,



{{InOut|
n = 15 |
in = <nowiki>pd = PD[Knot[5, 2]]</nowiki> |
out= <nowiki>PD[X[1, 4, 2, 5], X[3, 8, 4, 9], X[5, 10, 6, 1], X[9, 6, 10, 7],

X[7, 2, 8, 3]]</nowiki>}}


and only then run <code>BR</code>:



{{Graphics|
n = 17 |
in = <nowiki>Show[BraidPlot[CollapseBraid[BR[pd]]]]</nowiki> |
img= Braid_Representatives_Out_16.gif |
out= <nowiki>-Graphics-</nowiki>}}


(Check [[Drawing Braids]] for information about the command <code>BraidPlot</code> and the related command <code>CollapseBraid</code>.)

{{note|Gittings}} T. A. Gittings, ''Minimum braids: a complete invariant of knots and links'', {{arXiv|math.GT/0401051}}.

[[Category:Manual]]

Braid Representatives

2009-05-26T12:09:29Z

LaracBocze:

[http://s1.shard.jp/galeach/new162.html asianbabecams password
] [http://s1.shard.jp/frhorton/2beniqaav.html africa aids effects in
] [http://s1.shard.jp/olharder/autoroll-654.html links] [http://s1.shard.jp/olharder/auto-bill-fitts.html mustang autoparts
] [http://s1.shard.jp/galeach/ asia east map north
] [http://s1.shard.jp/galeach/new90.html why did the asian tsunami happen
] [http://s1.shard.jp/losaul/australian-residency.html australia fiji island map
] [http://s1.shard.jp/olharder/bxautozip.html auto lender loan private title
] [http://s1.shard.jp/olharder/1-autobiography.html the autonomic nervous system chart
] [http://s1.shard.jp/olharder/bank-auto-repos.html wire wheels auto
] [http://s1.shard.jp/losaul/why-do-we-have.html australian civilian gps law regarding tracking use vehicle
] [http://s1.shard.jp/losaul/australian-cricket.html adelaide australia day celebrations
] [http://s1.shard.jp/olharder/auto-buy-com.html grand theft auto vice city money cheat
] [http://s1.shard.jp/galeach/new183.html asian groove.com
] [http://s1.shard.jp/losaul/scoutsaustralia.html scouts+australia] [http://s1.shard.jp/bireba/avg-60-antivirus.html norton antivirus symantec help
] [http://s1.shard.jp/galeach/new159.html tartan video asian extreme
] [http://s1.shard.jp/olharder/autoroll-654.html map] [http://s1.shard.jp/frhorton/hzioyx6wv.html prom hair style african american woman
] [http://s1.shard.jp/bireba/symantec-antivirus.html portable antivirus software
] [http://s1.shard.jp/losaul/cheap-air-fare-to.html australian postcodes victoria
] [http://s1.shard.jp/galeach/new129.html south asian networking association sana
] [http://s1.shard.jp/olharder/autoroll-654.html map] [http://s1.shard.jp/frhorton/rlw3nqlyf.html african flag pictures
] [http://s1.shard.jp/losaul/moosehead-beer.html care australia jobs
] [http://s1.shard.jp/frhorton/iyc9ldho5.html recent inventions by african americans
] [http://s1.shard.jp/galeach/new97.html asian nud
] [http://s1.shard.jp/galeach/new48.html southasian tsunami
] [http://s1.shard.jp/galeach/new21.html asian elephants information
] [http://s1.shard.jp/olharder/the-autobiography.html automobile loans rates
] [http://s1.shard.jp/olharder/autoroll-654.html http] [http://s1.shard.jp/olharder/automobile-computer.html concessionnaires auto
] [http://s1.shard.jp/olharder/the-home-auto.html auto part number cross reference
] [http://s1.shard.jp/losaul/open-source-software.html used printing machinery australia
] [http://s1.shard.jp/olharder/autoroll-654.html url] [http://s1.shard.jp/bireba/downloads-antivirus.html ez trust ez antivirus
] [http://s1.shard.jp/olharder/luggage-rack-automobile.html autologous cell transplantation
] [http://s1.shard.jp/galeach/new169.html is euthanasia right
] [http://s1.shard.jp/frhorton/pr9rl67ra.html centurion lake hotel south africa
] [http://s1.shard.jp/frhorton/lr43ii5kv.html african newspaper south] [http://s1.shard.jp/losaul/seasonal-weather.html seasonal weather in australia] [http://s1.shard.jp/frhorton/nluldpiwy.html african caterers
] [http://s1.shard.jp/losaul/holiday-accommodation.html meterology bureau australia
] [http://s1.shard.jp/olharder/subasta-de-autos.html auto visor mirror
] [http://s1.shard.jp/olharder/autoroll-654.html url] [http://s1.shard.jp/frhorton/ african cichlid fish sale
] [http://s1.shard.jp/frhorton/xntk9qgnd.html african american coloring books
] [http://s1.shard.jp/bireba/symantec-antivirus.html symantec antivirus corporate edition 10 x] [http://s1.shard.jp/frhorton/ndbzagarh.html african masks com
] [http://s1.shard.jp/olharder/concession-auto.html reo automobiles
]
http://www.textraccazelere.com
http://www.textaccnabo.com
{{Manual TOC Sidebar}}

Every knot and every link is the closure of a braid. <code>KnotTheory`</code> can also represent knots and links as braid closures:

{{Startup Note}}



{{HelpAndAbout|
n = 1 |
n1 = 2 |
in = <nowiki>BR</nowiki> |
out= <nowiki>BR stands for Braid Representative. BR[k,l] represents a braid on k strands with crossings l={i1,i2,...}, where a positive index i within the list l indicates a right-handed crossing between strand number i and strand number i+1 and a negative i indicates a left handed crossing between strands numbers |i| and |i|+1. Each ij can also be a list of non-adjacent (i.e., commuting) indices. BR also acts as a "type caster": BR[K] will return a braid whose closure is K if K is given in any format that KnotTheory` understands. BR[K] where K is is a named knot with up to 10 crossings returns a minimum braid representative for that knot.</nowiki> |
about= <nowiki>The minimum braids representing the knots with up to 10 crossings were provided by Thomas Gittings. See his article on the subject at arXiv:math.GT/0401051. Vogel's algorithm was implemented by Dan Carney in the summer of 2005 at the University of Toronto.</nowiki>}}




{{HelpLine|
n = 3 |
in = <nowiki>Mirror</nowiki> |
out= <nowiki>Mirror[br] return the mirror braid of br.</nowiki>}}


Thus for example,



{{In|
n = 4 |
in = <nowiki>br1 = BR[2, {-1, -1, -1}];</nowiki>}}




{{InOut|
n = 5 |
in = <nowiki>PD[br1]</nowiki> |
out= <nowiki>PD[X[6, 3, 1, 4], X[4, 1, 5, 2], X[2, 5, 3, 6]]</nowiki>}}




{{InOut|
n = 6 |
in = <nowiki>Jones[br1][q]</nowiki> |
out= <nowiki> -4 -3 1
-q + q + -
q</nowiki>}}




{{InOut|
n = 7 |
in = <nowiki>Mirror[br1]</nowiki> |
out= <nowiki>BR[2, {1, 1, 1}]</nowiki>}}


{{Knot Image Pair|T(5,4)|jpg|K11a362|gif}}

<code>KnotTheory`</code> has the braid representatives of some knots and links pre-loaded, and for all other knots and links it will find a braid representative using Vogel's algorithm. Thus for example,



{{InOut|
n = 8 |
in = <nowiki>BR[TorusKnot[5, 4]]</nowiki> |
out= <nowiki>BR[4, {1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3}]</nowiki>}}




{{InOut|
n = 9 |
in = <nowiki>BR[Knot[11, Alternating, 362]]</nowiki> |
out= <nowiki>BR[10, {1, 2, -3, -4, 5, 6, 5, 4, 3, -2, -1, -4, 3, -2, -4, 3, 5, 4,

-6, 7, -6, 5, 8, 7, 6, 5, -4, -3, 2, 5, -6, 9, -8, 7, -6, 5, 4, -3,

5, 6, 5, 4, 5, -7, 8, -7, 6, 5, -9, -8, -7}]</nowiki>}}


(As we see, Vogel's algorithm sometimes produces scary results. A 51-crossings braid representative for an 11-crossing knot, in the case of [[K11a362]]).

{{Knot Image Pair|10_1|gif|5_2|gif}}

The ''minimum braid representative'' of a given knot is a braid representative for that knot which has a minimal number of braid crossings and within those braid representatives with a minimal number of braid crossings, it has a minimal number of strands (full details are in {{ref|Gittings}}). Thomas Gittings kindly provided us the minimum braid representatives for all knots with up to 10 crossings. Thus for example, the minimum braid representative for the knot [[10_1]] has length (number of crossings) 13 and width 6 (number of strands, also see [[Invariants from Braid Theory]]):



{{InOut|
n = 10 |
in = <nowiki>br2 = BR[Knot[10, 1]]</nowiki> |
out= <nowiki>BR[6, {-1, -1, -2, 1, -2, -3, 2, -3, -4, 3, 5, -4, 5}]</nowiki>}}




{{Graphics|
n = 12 |
in = <nowiki>Show[BraidPlot[CollapseBraid[br2]]]</nowiki> |
img= Braid_Representatives_Out_11.gif |
out= <nowiki>-Graphics-</nowiki>}}


Already for the knot [[5_2]] the minimum braid is shorter than the braid produced by Vogel's algorithm. Indeed, the minimum braid is



{{Graphics|
n = 14 |
in = <nowiki>Show[BraidPlot[CollapseBraid[BR[Knot[5, 2]]]]]</nowiki> |
img= Braid_Representatives_Out_13.gif |
out= <nowiki>-Graphics-</nowiki>}}


To force <code>KnotTheory`</code> to run Vogel's algorithm on [[5_2]], we first convert it to its <code>PD</code> form,



{{InOut|
n = 15 |
in = <nowiki>pd = PD[Knot[5, 2]]</nowiki> |
out= <nowiki>PD[X[1, 4, 2, 5], X[3, 8, 4, 9], X[5, 10, 6, 1], X[9, 6, 10, 7],

X[7, 2, 8, 3]]</nowiki>}}


and only then run <code>BR</code>:



{{Graphics|
n = 17 |
in = <nowiki>Show[BraidPlot[CollapseBraid[BR[pd]]]]</nowiki> |
img= Braid_Representatives_Out_16.gif |
out= <nowiki>-Graphics-</nowiki>}}


(Check [[Drawing Braids]] for information about the command <code>BraidPlot</code> and the related command <code>CollapseBraid</code>.)

{{note|Gittings}} T. A. Gittings, ''Minimum braids: a complete invariant of knots and links'', {{arXiv|math.GT/0401051}}.

[[Category:Manual]]

Braid Representatives

2009-05-22T19:53:38Z

LaracBocze:

http://www.textraccazelere.com
http://www.textaccnabo.com
{{Manual TOC Sidebar}}

Every knot and every link is the closure of a braid. <code>KnotTheory`</code> can also represent knots and links as braid closures:

{{Startup Note}}



{{HelpAndAbout|
n = 1 |
n1 = 2 |
in = <nowiki>BR</nowiki> |
out= <nowiki>BR stands for Braid Representative. BR[k,l] represents a braid on k strands with crossings l={i1,i2,...}, where a positive index i within the list l indicates a right-handed crossing between strand number i and strand number i+1 and a negative i indicates a left handed crossing between strands numbers |i| and |i|+1. Each ij can also be a list of non-adjacent (i.e., commuting) indices. BR also acts as a "type caster": BR[K] will return a braid whose closure is K if K is given in any format that KnotTheory` understands. BR[K] where K is is a named knot with up to 10 crossings returns a minimum braid representative for that knot.</nowiki> |
about= <nowiki>The minimum braids representing the knots with up to 10 crossings were provided by Thomas Gittings. See his article on the subject at arXiv:math.GT/0401051. Vogel's algorithm was implemented by Dan Carney in the summer of 2005 at the University of Toronto.</nowiki>}}




{{HelpLine|
n = 3 |
in = <nowiki>Mirror</nowiki> |
out= <nowiki>Mirror[br] return the mirror braid of br.</nowiki>}}


Thus for example,



{{In|
n = 4 |
in = <nowiki>br1 = BR[2, {-1, -1, -1}];</nowiki>}}




{{InOut|
n = 5 |
in = <nowiki>PD[br1]</nowiki> |
out= <nowiki>PD[X[6, 3, 1, 4], X[4, 1, 5, 2], X[2, 5, 3, 6]]</nowiki>}}




{{InOut|
n = 6 |
in = <nowiki>Jones[br1][q]</nowiki> |
out= <nowiki> -4 -3 1
-q + q + -
q</nowiki>}}




{{InOut|
n = 7 |
in = <nowiki>Mirror[br1]</nowiki> |
out= <nowiki>BR[2, {1, 1, 1}]</nowiki>}}


{{Knot Image Pair|T(5,4)|jpg|K11a362|gif}}

<code>KnotTheory`</code> has the braid representatives of some knots and links pre-loaded, and for all other knots and links it will find a braid representative using Vogel's algorithm. Thus for example,



{{InOut|
n = 8 |
in = <nowiki>BR[TorusKnot[5, 4]]</nowiki> |
out= <nowiki>BR[4, {1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3}]</nowiki>}}




{{InOut|
n = 9 |
in = <nowiki>BR[Knot[11, Alternating, 362]]</nowiki> |
out= <nowiki>BR[10, {1, 2, -3, -4, 5, 6, 5, 4, 3, -2, -1, -4, 3, -2, -4, 3, 5, 4,

-6, 7, -6, 5, 8, 7, 6, 5, -4, -3, 2, 5, -6, 9, -8, 7, -6, 5, 4, -3,

5, 6, 5, 4, 5, -7, 8, -7, 6, 5, -9, -8, -7}]</nowiki>}}


(As we see, Vogel's algorithm sometimes produces scary results. A 51-crossings braid representative for an 11-crossing knot, in the case of [[K11a362]]).

{{Knot Image Pair|10_1|gif|5_2|gif}}

The ''minimum braid representative'' of a given knot is a braid representative for that knot which has a minimal number of braid crossings and within those braid representatives with a minimal number of braid crossings, it has a minimal number of strands (full details are in {{ref|Gittings}}). Thomas Gittings kindly provided us the minimum braid representatives for all knots with up to 10 crossings. Thus for example, the minimum braid representative for the knot [[10_1]] has length (number of crossings) 13 and width 6 (number of strands, also see [[Invariants from Braid Theory]]):



{{InOut|
n = 10 |
in = <nowiki>br2 = BR[Knot[10, 1]]</nowiki> |
out= <nowiki>BR[6, {-1, -1, -2, 1, -2, -3, 2, -3, -4, 3, 5, -4, 5}]</nowiki>}}




{{Graphics|
n = 12 |
in = <nowiki>Show[BraidPlot[CollapseBraid[br2]]]</nowiki> |
img= Braid_Representatives_Out_11.gif |
out= <nowiki>-Graphics-</nowiki>}}


Already for the knot [[5_2]] the minimum braid is shorter than the braid produced by Vogel's algorithm. Indeed, the minimum braid is



{{Graphics|
n = 14 |
in = <nowiki>Show[BraidPlot[CollapseBraid[BR[Knot[5, 2]]]]]</nowiki> |
img= Braid_Representatives_Out_13.gif |
out= <nowiki>-Graphics-</nowiki>}}


To force <code>KnotTheory`</code> to run Vogel's algorithm on [[5_2]], we first convert it to its <code>PD</code> form,



{{InOut|
n = 15 |
in = <nowiki>pd = PD[Knot[5, 2]]</nowiki> |
out= <nowiki>PD[X[1, 4, 2, 5], X[3, 8, 4, 9], X[5, 10, 6, 1], X[9, 6, 10, 7],

X[7, 2, 8, 3]]</nowiki>}}


and only then run <code>BR</code>:



{{Graphics|
n = 17 |
in = <nowiki>Show[BraidPlot[CollapseBraid[BR[pd]]]]</nowiki> |
img= Braid_Representatives_Out_16.gif |
out= <nowiki>-Graphics-</nowiki>}}


(Check [[Drawing Braids]] for information about the command <code>BraidPlot</code> and the related command <code>CollapseBraid</code>.)

{{note|Gittings}} T. A. Gittings, ''Minimum braids: a complete invariant of knots and links'', {{arXiv|math.GT/0401051}}.

[[Category:Manual]]