A New Algorithm in Geometry of Numbers

Details A New Algorithm in Geometry of Numbers A New Algorithm in Geometry of Numbers

2007-10-25

arxiv.org/abs/0710.4948v1

Proceedings of The 4th International Symposium on Voronoi Diagrams in Science and Engineering, Pontypridd, Wales, UK, 9-11 Jul

Mathematics

Number Theory

7 pages, 3 figures; Proceedings of ISVD-07, International Symposium on Voronoi diagrams in Science and Engineering held in Jul

Scientific paper

A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the previously used method. We have implemented and used our algorithm for finding perfect Delaunay polytopes in dimensions 6, 7, 8. Our findings lead to a new conjecture that sheds light on the structure of lattice Delaunay tilings.

Affiliated with

Also associated with

No associations

Rating

A New Algorithm in Geometry of Numbers 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 A New Algorithm in Geometry of Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Algorithm in Geometry of Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190908