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

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages

Scientific paper

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].

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Degree complexity of birational maps related to matrix inversion: Symmetric case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Degree complexity of birational maps related to matrix inversion: Symmetric case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Degree complexity of birational maps related to matrix inversion: Symmetric case will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-297993

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.