Abstract
Spatial complexity can be created from simple square maps. By partitioning space according to a partitions formula, the total number of possible spatial partitions can be derived and then, applying the Burnside lemma gives the total number of symmetric maps allowed by combinatorics. The number of possible map configurations quickly “explodes” and this poses restrictions to spatial analysis. Beginning with a restricted and manageable number of generic maps and subjecting them to symmetric transformations of the symmetry group of the square, it is possible to create big numbers of possible spatial configurations. Thus a space of numbers (a “Spatium Numerorum”) is created, beginning with partitions of numbers which are calculated by partitions formulas (i.e. the Hardy-Ramanujan, Rademacher and Bruinier & Ono).
Sign-in/Register to access full text options 
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.
