dc.contributor.author |
Margenstern, M |
en |
dc.date.accessioned |
2009-04-16T23:13:04Z |
en |
dc.date.available |
2009-04-16T23:13:04Z |
en |
dc.date.issued |
2003-02 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-211 (2003) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3718 |
en |
dc.description.abstract |
The splitting method, which was defined by the author in [9,10] is at the basis of the notion of combinatoric tilings. As a consequence of this notion, there is a recurrence sequence which allows us to compute the number of tiles which are at a fixed distance from a given tile. A polynomial is attached to the sequence as well as a language which can be used for implementing cellular automata on the tiling. We give here the polynomial and, as a first consequence, the language of the splitting is not regular, as it is the case in the tiling of hyperbolic 3D space by regular dodecahedra which is also combinatoric. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
The Tiling of the Hyperbolic 4D Space by the 120-Cell Is Combinatoric |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |