Four encounters with Sierpiński's gasket
From MaRDI portal
Publication:1343282
DOI10.1007/BF03024718zbMath0814.28002OpenAlexW2044354185MaRDI QIDQ1343282
Publication date: 1 February 1995
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03024718
History of mathematics in the 20th century (01A60) Fractals (28A80) History of measure and integration (28-03)
Related Items (13)
Generalized Pascal triangle for binomial coefficients of words ⋮ Forgotten fractals ⋮ The beginning of Polish topology ⋮ Analysis of orthogonality and of orbits in affine iterated function systems ⋮ Sums of products of binomial coefficients mod 2 and run length transforms of sequences ⋮ Green's function approach for quantum graphs: an overview ⋮ Schur subalgebras and an application to the symmetric group ⋮ Approximate self-assembly of the Sierpinski triangle ⋮ On the number of generators for transeunt triangles ⋮ On irreversibility of von Neumann additive cellular automata on grids ⋮ Some two-point resistances of the Sierpinski gasket network ⋮ Lacing irregular shoes ⋮ Recurrence along directions in multidimensional words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general algorithm for finding a shortest path between two n- configurations
- Divisibility - with visibility
- Shortest paths between regular states of the Tower of Hanoi
- The tower of Hanoi
- Extending the binomial coefficients to preserve symmetry and pattern
- Adjudicating a towers of hanoi contest†
- Algorithmic Information Theory
- Towers of hanoi graphs
- A statistical analysis of the towers of hanoi problem
- Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
- Notes on Binomial Coefficients Ii-The Least N such that pe Divides an r -Nomial Coefficient of Rank n †
- Notes on Binomial Coefficients Iii-Any Integer Divides Almost All Binomial Coefficients†
This page was built for publication: Four encounters with Sierpiński's gasket
