首页> 外文期刊>Mathematische Zeitschrift >Degree complexity of birational maps related to matrix inversion: Symmetric case
【24h】

Degree complexity of birational maps related to matrix inversion: Symmetric case

机译:与矩阵求逆相关的二元映射的度复杂度:对称情况

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

For q ≥ 3, we let S _q denote the projectivization of the set of symmetric q × q matrices with coefficients in ?. We let I(x) = (x _(i,j)) denote the matrix inverse, and we let J(x) = (x _(i,j) ~(-1)) be the matrix whose entries are the reciprocals of the entries of x. We let K{pipe}S _q = I J: S _q → S _q denote the restriction of the composition I J to S _q. This is a birational map whose properties have attracted some attention in statistical mechanics. In this paper we compute the degree complexity of K{pipe}S _q thus confirming a conjecture of Angles d'Auriac et al. (J Phys A Math Gen 39:3641-3654, 2006).
机译:对于q≥3,我们令S _q表示系数为的对称q×q矩阵集的投影。我们让I(x)=(x _(i,j))表示矩阵逆,我们让J(x)=(x _(i,j)〜(-1))是其项为x的倒数。我们让K {pipe} S _q = I J:S _q→S _q表示组成I J对S _q的限制。这是一个两分图,其属性已引起统计力学的注意。在本文中,我们计算了K {pipe} S _q的度数复杂度,从而确定了Angles d'Auriac等人的猜想。 (J Phys A Math Gen 39:3641-3654,2006)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号