Abstract
We outline an algorithm for generating nets, a “net” being a geometric graph embedded in a space on which some group acts transitively. We prove that any connected net in such a space can be generated by this process, which can also be regarded as a covering of the net by copies of a connected “transversal” subnet. This paper outlines some of the underlying theory supporting a crystal prediction and design program currently under development. The paper begins with some background in geometric group theory.
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.
