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

preprint2010arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.