home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!darwin.sura.net!spool.mu.edu!umn.edu!csus.edu!ucdavis!!cs.ucdavis.edu!shaw
- From: shaw@toadflax.UCDavis.EDU (Rob Shaw)
- Newsgroups: sci.math
- Subject: Penrose Tiles / Beatty Seq's.
- Message-ID: <18007@ucdavis.ucdavis.edu>
- Date: 10 Oct 92 03:45:28 GMT
- Sender: usenet@ucdavis.ucdavis.edu
- Reply-To: shaw@toadflax.UCDavis.EDU (Rob Shaw)
- Followup-To: comp.theory,rec.puzzles
- Organization: UC Davis, EECS Division of Computer Science
- Lines: 36
-
-
- A while ago I was reading a Gardner-ish rec math book, and
- it contained an update about Penrose tilings. I would
- appreciate anyone giving me pointers to the material below,
- since I have completely forgotten where I read this.
-
- The are only a handful of Penrose (kite+dart) tilings as
- shown by taking infinite strips across the tiling. These
- strips come in a sequence containing "thin" and "thick"
- strips. The sequence is a Beatty sequence.
-
- Something like
-
- 10010101001010010010010...
-
- Could be a Beatty sequence, since one of the two elements
- always appears alone, and the other appears alone or in
- pairs.
-
- This book also described how successive powers of the
- golden ratio, rounded up and down form complementary
- Beatty sequences, and moreover, that one of these
- sequences is something that was previously thought
- to only be computable by some recursive method that
- required calculating all the terms preceding the
- desired one.
-
- This is all from memory, so I may have gotten a few things
- confused...
-
- Please, anyone who can give me pointers to books/articles
- about this material, please post or email.
-
- Thanx!
-
- Rob
-