Periodic Euclidean Graphs on Integer Points

Details Periodic Euclidean Graphs on Integer Points Periodic Euclidean Graphs on Integer Points

2011-05-11

arxiv.org/abs/1105.2328v1

Mathematics

Combinatorics

Submitted for publication

Scientific paper

A uniformly discrete Euclidean graph is a graph embedded in a Euclidean space so that there is a minimum distance between distinct vertices. If such a graph embedded in an $n$-dimensional space is preserved under $n$ linearly independent translations, it is "$n$-periodic" in the sense that the quotient group of its symmetry group divided by the translational subgroup of its symmetry group is finite. We present a refinement of a theorem of Bieberbach: given a $n$-periodic uniformly discrete Euclidean graph embedded in a $n$-dimensional Euclidean space of symmetry group $\bbbS$, there is another $n$-periodic uniformly discrete Euclidean graph embedded in the same space whose vertices are integer points (possibly modulo an affine transformation) and whose symmetry group has a (not necessarily proper) subgroup isomorphic to $\bbbS$. We conclude with a discussion of an application to the computer generation of "crystal nets".

Affiliated with

Also associated with

No associations

Rating

Periodic Euclidean Graphs on Integer Points does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Periodic Euclidean Graphs on Integer Points, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Periodic Euclidean Graphs on Integer Points will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-496374