期刊文献+

辫群的结点矩阵表示法

Node Matrix Representation of Braid Group
下载PDF
导出
摘要 利用矩阵乘法规则与辫子乘法中图形的上下对应连接有类似之处这一特点,提出一种用结点矩阵表示辫子的方法.经过标记结点,确定矩阵中非零元素的位置以及非零元素表达式3个步骤即可求出一个辫子的结点矩阵表达式.该方法能够解决共轭等辫群中的难解问题.与已有的Burau表示法相比,它在与图形的转化以及矩阵求逆等方面有着一定的优越性. Based on the point that there is something in common between the rules of matrix multiplication and the figure connection in braid multiplication, this paper gave a new representation of braid group called node matrix representation. By signing the nodes, confirming the location of the nonzero elements in the matrix, and calculating the expression of the nonzero elements, the node matrix expression of a braid can be calculated. This method can also resolve some difficult problems in braid group like conjugacy problem. Compared with Burau representation, node matrix representation has advantages in transforming with figures and calculating the contradiction matrix.
出处 《武汉大学学报(理学版)》 CAS CSCD 北大核心 2008年第5期565-570,共6页 Journal of Wuhan University:Natural Science Edition
基金 国家高技术研究发展计划(863)项目(2007AA01Z427,2007AA01Z450) 国家自然科学基金资助项目(60573048,60773135,90718007)
关键词 辫群 结点矩阵表示法 Burau表示法 braid group node matrix representation Burau representation
  • 相关文献

参考文献1

二级参考文献18

  • 1P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer [J]. SIAM Journal on Computing, 1997, 26(5) : 1484-1509
  • 2R. Boneh, R. Lipton. Quantum cryptanalysis of hidden linear functions [G]. In: Advances in Cryptology-Crypto'95, Lecture Notes in Computer Science 963. Berlin: Springer-Verlag, 1995.424 - 437
  • 3L. M. K. Vandersypen, M. Steffen, G. Breyta, et al.Experimental realization of Shor' s quantum factoring algorithm using nuclear magnetic resonance [J]. Nature, 2001, 414(6866) : 883-887
  • 4E. Artin. Theory of braids [J]. Ann. of Math. , 1947, 48(1):101 - 126
  • 5F. A. Garside. The braid group and other groups [J]. Quart. J.Math., 1969, 20(4): 235-254
  • 6K. H. Ko, S. J. Lee, J. H. Cheon, et al. New public-key cryptosystem using braid groups [G]. In: Advances in Cryptology-CRYPTO 2000, Lecture Notes in Computer Science 1880. Berlin:Springer-Verlag, 2000. 166-183
  • 7E. Lee, J. H. Park. Cryptanalysis of the public key encryption based on braid groups [G]. In: Advances in Cryptology-EuroCrypt 2003, Lecture Notes in Computer Science 2656.Berlin: Springer-Verlag, 2003. 477-490
  • 8V. B. Styshnev. The extraction of a root in a braid group(English)[J]. Math. USSR Izv, 1979, 13(2): 405-416
  • 9H. Sibert. Extraction of roots in Garside groups [J]. Comm.Algebra, 2002, 30(6) : 2915-2927
  • 10J. Gonzalez-Meneses. The n-th root of a braid is unique up to conjugacy [J]. Alg. Geom. Topology, 2003, 3:1103-1118

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部