本文印刷
全画面プリント
トポロジー火曜セミナー
過去の記録 ～03/27｜次回の予定｜今後の予定 03/28～
| 開催情報 | 火曜日 17:00～18:30 数理科学研究科棟(駒場) 056号室 |
|---|---|
| 担当者 | 河澄 響矢, 北山 貴裕, 逆井卓也 |
| セミナーURL | http://park.itc.u-tokyo.ac.jp/MSF/topology/TuesdaySeminar/index.html |
2024年07月23日(火)
17:00-18:30 数理科学研究科棟(駒場) ハイブリッド開催/056号室
対面参加、オンライン参加のいずれの場合もセミナーのホームページから参加登録を行って下さい。
川室 圭子 氏 (University of Iowa)
Shortest word problem in braid theory (JAPANESE)
https://park.itc.u-tokyo.ac.jp/MSF/topology/TuesdaySeminar/index_e.html
対面参加、オンライン参加のいずれの場合もセミナーのホームページから参加登録を行って下さい。
川室 圭子 氏 (University of Iowa)
Shortest word problem in braid theory (JAPANESE)
[ 講演概要 ]
Given a braid element in B_n, searching for a shortest braid word representative (using the band-generators) is called the Shortest Braid Problem. Up to braid index n = 4, this problem has been solved by Kang, Ko, and Lee in 1997. In this talk I will discuss recent development of this problem for braid index 5 or higher. I will also show diagrammatic computational technique of the Left Canonical Form of a given braid, that is a key to the three fundamental problems in braid theory; the Word Problem, the Conjugacy Problem and the Shortest Word Problem. This is joint work with Rebecca Sorsen and Michele Capovilla-Searle.
[ 参考URL ]Given a braid element in B_n, searching for a shortest braid word representative (using the band-generators) is called the Shortest Braid Problem. Up to braid index n = 4, this problem has been solved by Kang, Ko, and Lee in 1997. In this talk I will discuss recent development of this problem for braid index 5 or higher. I will also show diagrammatic computational technique of the Left Canonical Form of a given braid, that is a key to the three fundamental problems in braid theory; the Word Problem, the Conjugacy Problem and the Shortest Word Problem. This is joint work with Rebecca Sorsen and Michele Capovilla-Searle.
https://park.itc.u-tokyo.ac.jp/MSF/topology/TuesdaySeminar/index_e.html
