arXiv Analytics

Sign in

arXiv:1005.4520 [math.DS]AbstractReferencesReviewsResources

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

Tuyen Trung Truong

Published 2010-05-25, updated 2010-11-04Version 2

For $q\geq 3$, we let $\mathcal{S}_q$ denote the projectivization of the set of symmetric $q\times q$ matrices with coefficients in $\mathbb{C}$. We let $I(x)=(x_{i,j})^{-1}$ denote the matrix inversion, 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|\mathcal{S}_q=I\circ J:\mathcal{S}_q\rightarrow \mathcal{S}_q$ denote the restriction of the composition $I\circ J$ to $\mathcal{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|\mathcal{S}_q$, thus confirming a conjecture of Angles d'Auriac, Maillard, and Viallet in [J. Phys. A: Math. Gen. 39 (2006), 3641--3654].

Comments: 14 pages
Categories: math.DS
Subjects: 37F99, 32H50
Related articles: Most relevant | Search more
arXiv:0711.1186 [math.DS] (Published 2007-11-07, updated 2007-11-09)
Degree Complexity of a Family of Birational Maps
arXiv:0801.0076 [math.DS] (Published 2007-12-29)
Degree complexity of a family of birational maps: II. Exceptional cases
arXiv:1704.07731 [math.DS] (Published 2017-04-25)
Dynamical Classification of a Family of Birational Maps of C^2 via Algebraic Entropy