"Braid group"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
imported>Pythagoras0
잔글 (찾아 바꾸기 – “<h5>” 문자열을 “==” 문자열로)
 
(사용자 2명의 중간 판 21개는 보이지 않습니다)
1번째 줄: 1번째 줄:
==review of symmetric groups</h5>
+
==review of symmetric groups==
  
 
* 원소의 개수가 n인 집합의 전단사함수들의 모임
 
* 원소의 개수가 n인 집합의 전단사함수들의 모임
* <math>n!</math> 개의 원소가 존재함
+
* <math>n!</math> 개의 원소가 존재함
 
* 대칭군의 부분군은 치환군(permutation group)이라 불림
 
* 대칭군의 부분군은 치환군(permutation group)이라 불림
  
 
+
  
 
+
  
==presentation of symmetric groups</h5>
+
==presentation of symmetric groups==
 +
* <math>S_n</math>
 +
*  generators <math>\sigma_1, \ldots, \sigma_{n-1}</math>
 +
*  relations
 +
** <math>{\sigma_i}^2 = 1</math>
 +
** <math>\sigma_i\sigma_j = \sigma_j\sigma_i \mbox{ if } j \neq i\pm 1</math>
 +
** <math>\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1}</math>
  
* 생성원 <math>\sigma_1, \ldots, \sigma_{n-1}</math><br>
+
   
*  relations<br>
 
** <math>{\sigma_i}^2 = 1</math><br>
 
** <math>\sigma_i\sigma_j = \sigma_j\sigma_i \mbox{ if } j \neq i\pm 1</math><br>
 
** <math>\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1}\</math><br>
 
  
 
+
==presentation of braid groups==
 +
* <math>B_n</math>
 +
* generators <math>\sigma_1,...,\sigma_{n-1}</math>
 +
* relations (known as the braid or Artin relations):
 +
** <math>\sigma_i\sigma_j =\sigma_j \sigma_i</math> whenever <math>|i-j| \geq 2 </math>
 +
** <math>\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i \sigma_{i+1}</math> for <math>i = 1,..., n-2</math>
 +
* [[Yang-Baxter equation (YBE)]]
 +
* For a solution of the YBE <math>\bar{R}</math>, we can construct a representation <math>\rho</math> of the braid group by
 +
:<math>
 +
\rho : B_n \to \rm{Aut}(V^{\otimes n})
 +
</math> where <math>\rho(\sigma_i)=\bar{R}_i</math>
  
==presentation of braid groups</h5>
 
  
<math>B_n</math>
+
There is also a natural surjective morphism from <math>B_n</math> to the symmetric group <math>\mathfrak{S}_n</math>, given  on the generators by <math>B_n\ni\sigma_i\mapsto s_i\in \mathfrak{S}_n</math>, <math>i=1,\dots,n-1</math>. For a braid <math>\beta\in B_n</math>, we denote <math>p_{\beta}</math> its image in <math>\mathfrak{S}_n</math>, and refer to <math>p_{\beta}</math> as to the underlying permutation of <math>\beta</math>.
  
generators <math>\sigma_1,...,\sigma_{n-1}</math>
 
  
relations (known as the braid or Artin relations):
+
==examples==
 +
* in a braid diagram, read from bottom to top and we number all strands of the braid with the indices it starts at the bottom
 +
[[파일:Braid.png]]
 +
* read the braid word from left to right accordingly.
 +
* For instance, the braid word corresponding to the braid above is <math>\sigma_1^{-1}\sigma_2\sigma_1^{-1}\sigma_2\sigma_1^{-1}</math>
  
<math>\sigma_i\sigma_j =\sigma_j \sigma_i</math> whenever <math>|i-j| \geq 2 </math>
+
==Markov moves==
 +
* braid group version of Reidemeister moves
  
<math>\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i \sigma_{i+1}</math> for <math>i = 1,..., n-2</math>[[Yang-Baxter equation (YBE)]]
 
  
 
+
==computational resource==
 +
* https://docs.google.com/file/d/0B8XXo8Tve1cxZ3NjMGpGUWI0QkE/edit
  
 
 
  
<h5 style="margin: 0px; line-height: 3.428em; color: rgb(34, 61, 103); font-family: 'malgun gothic',dotum,gulim,sans-serif; font-size: 1.166em; background-position: 0px 100%;">related items</h5>
+
  
* [[Jones polynomials]]<br>
+
==related items==
* [[Hecke algebra]]<br>
 
  
 
+
* [[Jones polynomials]]
 
+
* [[Hecke algebra]]
 
+
* [[Loop braid group]]
 
 
<h5 style="line-height: 3.428em; margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic', dotum, gulim, sans-serif; font-size: 1.166em; background-image: ; background-color: initial; background-position: 0px 100%;">encyclopedia</h5>
 
  
 +
==encyclopedia==
 
* http://en.wikipedia.org/wiki/Braid_group
 
* http://en.wikipedia.org/wiki/Braid_group
* http://en.wikipedia.org/wiki/
 
* http://www.scholarpedia.org/
 
* http://www.proofwiki.org/wiki/
 
* Princeton companion to mathematics([[2910610/attachments/2250873|Companion_to_Mathematics.pdf]])
 
 
 
 
 
 
 
 
<h5 style="line-height: 3.428em; margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic', dotum, gulim, sans-serif; font-size: 1.166em; background-image: ; background-color: initial; background-position: 0px 100%;">books</h5>
 
 
 
 
 
* [[2010년 books and articles]]<br>
 
* http://gigapedia.info/1/
 
* http://gigapedia.info/1/
 
* http://www.amazon.com/s/ref=nb_ss_gw?url=search-alias%3Dstripbooks&field-keywords=
 
 
[[4909919|4909919]]
 
 
 
 
 
 
 
 
<h5 style="line-height: 3.428em; margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic', dotum, gulim, sans-serif; font-size: 1.166em; background-image: ; background-color: initial; background-position: 0px 100%;">articles</h5>
 
 
 
 
 
* http://www.ams.org/mathscinet
 
* [http://www.zentralblatt-math.org/zmath/en/ ]http://www.zentralblatt-math.org/zmath/en/
 
* http://arxiv.org/
 
* http://www.pdf-search.org/
 
* http://pythagoras0.springnote.com/
 
* [http://math.berkeley.edu/%7Ereb/papers/index.html http://math.berkeley.edu/~reb/papers/index.html]
 
* http://dx.doi.org/
 
 
 
 
 
 
 
 
<h5 style="line-height: 3.428em; margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic', dotum, gulim, sans-serif; font-size: 1.166em; background-image: ; background-color: initial; background-position: 0px 100%;">question and answers(Math Overflow)</h5>
 
 
* http://mathoverflow.net/search?q=
 
* http://mathoverflow.net/search?q=
 
 
 
 
 
 
 
 
<h5 style="line-height: 3.428em; margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic', dotum, gulim, sans-serif; font-size: 1.166em; background-image: ; background-color: initial; background-position: 0px 100%;">blogs</h5>
 
 
*  구글 블로그 검색<br>
 
**  http://blogsearch.google.com/blogsearch?q=<br>
 
** http://blogsearch.google.com/blogsearch?q=
 
* http://ncatlab.org/nlab/show/HomePage
 
 
 
 
 
 
 
 
<h5 style="line-height: 3.428em; margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic', dotum, gulim, sans-serif; font-size: 1.166em; background-image: ; background-color: initial; background-position: 0px 100%;">experts on the field</h5>
 
 
* http://arxiv.org/
 
  
 
+
 +
==expositions==
 +
* Abad, Camilo Arias. 2014. “Introduction to Representations of Braid Groups.” arXiv:1404.0724 [math], April. http://arxiv.org/abs/1404.0724.
  
 
+
  
<h5 style="line-height: 3.428em; margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic', dotum, gulim, sans-serif; font-size: 1.166em; background-image: ; background-color: initial; background-position: 0px 100%;">links</h5>
+
[[분류:개인노트]]
 +
[[분류:math and physics]]
 +
[[분류:migrate]]
  
* [http://detexify.kirelabs.org/classify.html Detexify2 - LaTeX symbol classifier]
+
==메타데이터==
* [http://pythagoras0.springnote.com/pages/1947378 수식표현 안내]
+
===위키데이터===
* [http://www.research.att.com/%7Enjas/sequences/index.html The On-Line Encyclopedia of Integer Sequences]
+
* ID :  [https://www.wikidata.org/wiki/Q220409 Q220409]
* http://functions.wolfram.com/
+
===Spacy 패턴 목록===
 +
* [{'LOWER': 'braid'}, {'LEMMA': 'group'}]

2021년 2월 17일 (수) 01:36 기준 최신판

review of symmetric groups

  • 원소의 개수가 n인 집합의 전단사함수들의 모임
  • \(n!\) 개의 원소가 존재함
  • 대칭군의 부분군은 치환군(permutation group)이라 불림



presentation of symmetric groups

  • \(S_n\)
  • generators \(\sigma_1, \ldots, \sigma_{n-1}\)
  • relations
    • \({\sigma_i}^2 = 1\)
    • \(\sigma_i\sigma_j = \sigma_j\sigma_i \mbox{ if } j \neq i\pm 1\)
    • \(\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1}\)


presentation of braid groups

  • \(B_n\)
  • generators \(\sigma_1,...,\sigma_{n-1}\)
  • relations (known as the braid or Artin relations):
    • \(\sigma_i\sigma_j =\sigma_j \sigma_i\) whenever \(|i-j| \geq 2 \)
    • \(\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i \sigma_{i+1}\) for \(i = 1,..., n-2\)
  • Yang-Baxter equation (YBE)
  • For a solution of the YBE \(\bar{R}\), we can construct a representation \(\rho\) of the braid group by

\[ \rho : B_n \to \rm{Aut}(V^{\otimes n}) \] where \(\rho(\sigma_i)=\bar{R}_i\)


There is also a natural surjective morphism from \(B_n\) to the symmetric group \(\mathfrak{S}_n\), given on the generators by \(B_n\ni\sigma_i\mapsto s_i\in \mathfrak{S}_n\), \(i=1,\dots,n-1\). For a braid \(\beta\in B_n\), we denote \(p_{\beta}\) its image in \(\mathfrak{S}_n\), and refer to \(p_{\beta}\) as to the underlying permutation of \(\beta\).


examples

  • in a braid diagram, read from bottom to top and we number all strands of the braid with the indices it starts at the bottom

파일:Braid.png

  • read the braid word from left to right accordingly.
  • For instance, the braid word corresponding to the braid above is \(\sigma_1^{-1}\sigma_2\sigma_1^{-1}\sigma_2\sigma_1^{-1}\)

Markov moves

  • braid group version of Reidemeister moves


computational resource



related items

encyclopedia


expositions

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'braid'}, {'LEMMA': 'group'}]