Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-26T06:04:14.263Z Has data issue: false hasContentIssue false

Iteration of order preserving subhomogeneous maps on a cone

Published online by Cambridge University Press:  11 January 2006

MARIANNE AKIAN
Affiliation:
INRIA, Domaine de Voluceau-Rocquencourt BP 105, 78153 Le Chesnay Cedex, France. e-mail: marianne.akian@inria.fr, stephane.gaubert@inria.fr
STÉPHANE GAUBERT
Affiliation:
INRIA, Domaine de Voluceau-Rocquencourt BP 105, 78153 Le Chesnay Cedex, France. e-mail: marianne.akian@inria.fr, stephane.gaubert@inria.fr
BAS LEMMENS
Affiliation:
Mathematics Institute, University of Warwick, Coventry CV4 7AL. e-mail: lemmens@maths.warwick.ac.uk
ROGER NUSSBAUM
Affiliation:
Department of Mathematics, Hill Center, Rutgers University New Brunswick, NJ, 08903, U.S.A. e-mail: nussbaum@math.rutgers.edu

Abstract

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps $f: K\,{\rightarrow}\, K$, where $K$ is a polyhedral cone in a finite dimensional vector space. We show that each bounded orbit of $f$ converges to a periodic orbit and, moreover, the period of each periodic point of $f$ is bounded by \[ \beta_N = \max_{q+r+s=N}\frac{N!}{q!r!s!}= \frac{N!}{\big\lfloor\frac{N}{3}\big\rfloor!\big\lfloor\frac{N\,{+}\,1}{3}\big\rfloor! \big\lfloor\frac{N\,{+}\,2}{3}\big\rfloor!}\sim \frac{3^{N+1}\sqrt{3}}{2\pi N}, \] where $N$ is the number of facets of the polyhedral cone. By constructing examples on the standard positive cone in $\mathbb{R}^n$, we show that the upper bound is asymptotically sharp.

These results are an extension of work by Lemmens and Scheutzow concerning periodic orbits in the interior of the standard positive cone in $\mathbb{R}^n$.

Type
Research Article
Copyright
2006 Cambridge Philosophical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)