Open Access

Fixed Points of Two-Sided Fractional Matrix Transformations

Fixed Point Theory and Applications20072007:041930

DOI: 10.1155/2007/41930

Received: 16 March 2006

Accepted: 20 November 2006

Published: 28 February 2007

Abstract

Let and be complex matrices, and consider the densely defined map on matrices. Its fixed points form a graph, which is generically (in terms of ) nonempty, and is generically the Johnson graph ; in the nongeneric case, either it is a retract of the Johnson graph, or there is a topological continuum of fixed points. Criteria for the presence of attractive or repulsive fixed points are obtained. If and are entrywise nonnegative and is irreducible, then there are at most two nonnegative fixed points; if there are two, one is attractive, the other has a limited version of repulsiveness; if there is only one, this fixed point has a flow-through property. This leads to a numerical invariant for nonnegative matrices. Commuting pairs of these maps are classified by representations of a naturally appearing (discrete) group. Special cases (e.g., is in the radical of the algebra generated by and ) are discussed in detail. For invertible size two matrices, a fixed point exists for all choices of if and only if has distinct eigenvalues, but this fails for larger sizes. Many of the problems derived from the determination of harmonic functions on a class of Markov chains.

[1234567]

Authors’ Affiliations

(1)
Mathematics Department, University of Ottawa

References

  1. Handelman D: Eigenvectors and ratio limit theorems for Markov chains and their relatives. Journal d'Analyse Mathématique 1999, 78: 61–116.MATHMathSciNetView ArticleGoogle Scholar
  2. Daughtry J: Isolated solutions of quadratic matrix equations. Linear Algebra and Its Applications 1978,21(1):89–94. 10.1016/0024-3795(87)90202-3MATHMathSciNetView ArticleGoogle Scholar
  3. Potter JE: Matrix quadratic solutions. SIAM Journal on Applied Mathematics 1966,14(3):496–501. 10.1137/0114044MATHMathSciNetView ArticleGoogle Scholar
  4. Beavers AN Jr., Denman ED: A new solution method for quadratic matrix equations. Mathematical Biosciences 1974,20(1–2):135–143. 10.1016/0025-5564(74)90073-XMATHMathSciNetView ArticleGoogle Scholar
  5. Douglas RG, Pearcy C: On a topology for invariant subspaces. Journal of Functional Analysis 1968,2(3):323–341. 10.1016/0022-1236(68)90010-4MATHMathSciNetView ArticleGoogle Scholar
  6. Godsil C: Association schemes. http://quoll.uwaterloo.ca/pstuff/assoc
  7. Handelman D: A less complicated formula for Johnson graphs. in preparation

Copyright

© David Handelman. 2007

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.