Burau representation and random walks on string links (Q1392491): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.2140/pjm.1998.182.289 / rank | |||
Property / author | |||
Property / author: Xiao Song Lin / rank | |||
Property / author | |||
Property / author: Xiao Song Lin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2154962969 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: q-alg/9605023 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.2140/PJM.1998.182.289 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:18, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Burau representation and random walks on string links |
scientific article |
Statements
Burau representation and random walks on string links (English)
0 references
20 December 1998
0 references
A string link is an oriented tangle diagram in the strip \({\mathbb R} \times [0, 1]\) with the bottom ends \(\{1 \times 0, \dots , n \times 0 \}\) and top ends \(\{1 \times 1, \dots , n \times 1 \}\). There are exactly \(n\) strands, each of them giving an oriented path from a bottom source \(i \times 0\) to a top sink \(i \times 1\). The authors generalize the Burau representation to a representation of the semigroup of string links. This generalization is based on a nice probabilistic interpretation of the Burau representation of the braid group offered by \textit{V. F. R. Jones} [Ann. Math., II. Ser. 126, 335-388 (1987; Zbl 0631.57005)]. It is shown that the presentation is determined by a linear system, and is determined by finite type string link invariants. The Markov processes on positive string links are discussed.
0 references
Burau representation
0 references
string links
0 references
random walks
0 references
finite type invariants
0 references
Markov process
0 references