Abstract
A regular lattice is an infinite array of points
where the \(\mathop a\limits_{ \sim i} \)’s are linearly independent base vectors, the li’s are integers, and there are as many \(\mathop x\limits_{ \sim O} \)’s as the number of interpenetrating lattices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1971 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Percus, J.K. (1971). Counting and Enumeration of a Regular Lattice. In: Combinatorial Methods. Applied Mathematical Sciences, vol 4. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6404-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6404-0_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90027-8
Online ISBN: 978-1-4612-6404-0
eBook Packages: Springer Book Archive