Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-29T03:45:09.395Z Has data issue: false hasContentIssue false
  • English
  • Français

Pascal's triangle, dynamical systems and attractors

Published online by Cambridge University Press:  19 September 2008

Fritz V. Haeseler ,
Heinz-Otto Peitgen  and
Gencho Skordev
Fritz V. Haeseler
Affiliation:
Center for Complex Systems and Visualization, Institute for Dynamical Systems, University of Bremen, D-2800 Bremen, 33, Germany
Heinz-Otto Peitgen
Affiliation:
Center for Complex Systems and Visualization, Institute for Dynamical Systems, University of Bremen, D-2800 Bremen, 33, Germany
Gencho Skordev
Affiliation:
Center for Complex Systems and Visualization, Institute for Dynamical Systems, University of Bremen, D-2800 Bremen, 33, Germany
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper establishes a global dynamical systems approach for the fractal patterns which are obtained when analysing the divisibility of binomial coefficients modulo a prime power. The general framework is within the class of hierarchical iterated function systems. As a consequence we obtain a complete deciphering of the hierarchical self-similarity features.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 12 , Issue 3 , September 1992 , pp. 479 - 486
Copyright
Copyright © Cambridge University Press 1992

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

References

REFERENCES

[1]Barnsley, M. & Demko, S.. Iterated function systems and the global construction of fractals. Proc Roy. Soc., London A399 (1985), 243.Google Scholar
[2]Barnsley, M.. Fractals Everywhere. Academic Press, San Diego, CA, 1988.Google Scholar
[3]Barnsley, M., Elton, J. & Hardin, D.. Recurrent iterated function systems. Constr. Appr. 5 (1989), 3–32.CrossRefGoogle Scholar
[4]Barnsley, M., Berger, M. & Soner, H.. Mixing Markov chains and their images. Prob. Eng. Inf. Sci. 2 (1988), 387–414.CrossRefGoogle Scholar
[5]Berger, M.. Images generated by orbits of 2-D Markov chains. Chance: New Directions for Statistics and Computing 2, no. 2 (1989) 18–28.CrossRefGoogle Scholar
[6]Berger, M.. Encoding images through transition probabilities. Math. Comput. Modelling 11 (1988), 575–577.CrossRefGoogle Scholar
[7]Bonadarenko, B.. Generalized Triangles and Pyramids of Pascal, Their fractals, Graphs and Applications. Tashkent, Fan, 1990 (in Russian).Google Scholar
[8]Edgar, G.. Measures, Topology and Fractal Geometry. Springer, Berlin, 1990.CrossRefGoogle Scholar
[9]Falconer, K.. The Geometry of Fractal Sets. Cambridge University Press, Cambridge, 1985.CrossRefGoogle Scholar
[10]Holte, J.. A recurrence relation approach to fractal dimension in Pascal triangle. ICM-90.Google Scholar
[11]Holte, J.. The dimension of the set of multinomial coefficients not divisible by n. AMS annual meeting, 01 18, 1991. Preprint.Google Scholar
[12]Hutchinson, J.. Fractals and self-similarity. Indiana Univ. Math. J. 30 (1981), 713–747.CrossRefGoogle Scholar
[13]Jürgens, H., Peitgen, H. -O. & Saupe, D.. IFS-Tutor, Software Package for Hierarchical Iterated Function Systems. Springer, Berlin, 1992.Google Scholar
[14]Kummer, E.. Über die Ergänzungssatze zu den allgemeinen Reciprocitätsgesetzen. J. Reine Ang. Math. 44 (1852), 93–146.Google Scholar
[15]Kuratowski, C.. Topologie I. Warszawa, PWN, 1958.Google Scholar
[16]Mauldin, R. & Williams, S.. HausdorS dimension in graph directed constructions. Trans. Amer. Math. Soc. 309 (1988), 811–829.CrossRefGoogle Scholar
[17]Sved, M. & Pitman, J.. Divisibility of binomial coefficients by prime powers a geometrical approach. Ars Combinatoria 26A (1988), 197–222.Google Scholar
[18]Williams, R.. Composition of contractions. Bol. Soc. Brasil. Mat. 2 (1971), 55–59.CrossRefGoogle Scholar
[19]Willson, S.. Cellular automata can generate fractals. Discrete Appl. Math. 8 (1984), 91–99.CrossRefGoogle Scholar