Abstract
In [Dann E. Passoja, Akhlesh Lakhtakia, Carpets and rugs: An exercise in numbers, Leonardo 25 (1) (1992) 69–71] an informal algorithm ‘to display interesting numeric patterns’ is described without any proof. We generalize this algorithm over arbitrary finite fields F q of characteristic p and we prove that it always generates some self-similar sets. For the prime fields F p the generalized algorithm produces p − 1 different self-similar sets. These sets are classified according to their arithmetic and their groups of symmetry.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
