Degree complexity of birational maps related to matrix inversion: Symmetric case
Abstract
For q≥ 3, we let Sq denote the projectivization of the set of symmetric q× q matrices with coefficients in C. We let I(x)=(xi,j)-1 denote the matrix inversion, and we let J(x)=(xi,j-1) be the matrix whose entries are the reciprocals of the entries of x. We let K|Sq=I J:Sq→ Sq denote the restriction of the composition I J to Sq. This is a birational map whose properties have attracted some attention in statistical mechanics. In this paper we compute the degree complexity of K|Sq, thus confirming a conjecture of Angles d'Auriac, Maillard, and Viallet in [J. Phys. A: Math. Gen. 39 (2006), 3641--3654].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.