Asymptotic height optimization for topical IFS , Tetris heaps , and the finiteness conjecture

@inproceedings{Thierry2000AsymptoticHO,
  title={Asymptotic height optimization for topical IFS , Tetris heaps , and the finiteness conjecture},
  author={Lecroq Thierry and Jean},
  year={2000}
}
A topical map is a map from R into itself verifying some conditions (see §1.2) and which, roughly speaking, behaves like a translation along some line, the amount of which is measured by a real number, called the average height (or average displacement) of the map. Then we look at a topical Iterated Function System (IFS), that is, a (finite) collection (Ti) of such maps, and want to find asymptotic bounds for the average height of arbitrary compositions of the Ti ; this can be seen as an… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Le poisson n’a pas d’arêtes

  • T. Bousch
  • Ann. Inst. H. Poincaré Proba. Stat
  • 2000

The finiteness conjecture for the generalized spectral radius of a set of matrices , Linear Algebra Appl

  • Y. Wang
  • 2000

Performance evaluation of timed Petri nets using heaps of pieces

  • S. Gaubert, J. Mairesse
  • IEEE Computer Society
  • 1999

Petri nets and performance models ( PNPM ’ 99 )

  • J. Mairesse, M. Silva
  • IEEE Computer Society
  • 1999

Similar Papers

Loading similar papers…