Please login to be able to save your searches and receive alerts for new content matching your search criteria.
In this paper we constructed an isomorphic group of binary matrices to a finite symmetric group. Our method is based on the inversion of permutations. Using this embedding we find an algorithm for writing down a standard braid word representation for each positive permutation braid. Also an algorithm for writing basis of Hecke algebra Hn+1 from such basis of Hn is given.