Fractal patterns in Gaussian and Stirling number tables (Q2715934)

From MaRDI portal





scientific article; zbMATH DE number 1600908
Language Label Description Also known as
English
Fractal patterns in Gaussian and Stirling number tables
scientific article; zbMATH DE number 1600908

    Statements

    0 references
    0 references
    0 references
    30 May 2001
    0 references
    fractal pattern
    0 references
    cellular automaton
    0 references
    Stirling number
    0 references
    binomial
    0 references
    \(q\)-binomial
    0 references
    Eulerian number
    0 references
    prime power
    0 references
    Sierpinski triangle
    0 references
    power law growth rate
    0 references
    Fractal patterns in Gaussian and Stirling number tables (English)
    0 references
    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. NEWLINENEWLINENEWLINEThese 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}}\).
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references