Lange, Ehler; Peitgen, Heinz-Otto; Skordev, Guentcho Fractal patterns in Gaussian and Stirling number tables. (English) Zbl 0963.11014 Ars Comb. 48, 3-26 (1998). Geometrical representations of certain classical number tables modulo a given prime power (binomials, Gaussian \(q\)-binomials and Stirling numbers of first and second kind) generate patterns with self-similarity features. Moreover, these patterns appear to be strongly related for all number tables under consideration, when a prime power is fixed. These experimental observations are made precise by interpreting the recursively defined number tables as the output of certain cellular automata (CA). For a broad class of CA it has been proven in 1992 that the long time evolution can generate fractal sets, whose properties can be understood by means of hierarchical iterated function systems. We use these results to show that the mentioned number tables \(\pmod {p^{\nu}}\) induce fractal sets which are homeomorphic to a universal fractal set denoted by \(S_{p^{\nu}}\) which we call Sierpinski triangle \(\pmod {p^{\nu}}\). Reviewer: Martin Klazar (Praha) Cited in 6 Documents MSC: 11B73 Bell and Stirling numbers 28A80 Fractals 11B65 Binomial coefficients; factorials; \(q\)-identities 68Q80 Cellular automata (computational aspects) 11B50 Sequences (mod \(m\)) Keywords:fractal pattern; cellular automaton; Stirling number; binomial; \(q\)-binomial; Eulerian number; prime power; Sierpinski triangle; power law growth rate PDFBibTeX XMLCite \textit{E. Lange} et al., Ars Comb. 48, 3--26 (1998; Zbl 0963.11014)