Algorithmische Konstruktionen von Gittern

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Ph.D. Thesis (german)

Scientific paper

The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed classifications of modular lattices in dimensions up to 14 with levels 3,5,7, and 11. We present a fast meta algorithm for the computation of a basis of a lattice which is given by a large generating system. A theoretical worst case boundary and practical experiments show important advantages in comparison to traditional methods. Up to small modifications we use this algorithm for the decomposition of a lattice into pairwise orthogonal sublattices. As a further result we prove a covering theorem for the generating system of a lattice. Let S be a minimal generating system of a lattice of rank n with generators not larger than B. Then S has at most n + log_2(n!(B/M)^n) elements. We describe and compute invariants of a lattice L like the spectrum of the discrete Fourier transform of the length function on L/2L. The numerical computation of a lattice quantizer and a quantizer of a union of cosets of a lattice are discussed.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Algorithmische Konstruktionen von Gittern 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 Algorithmische Konstruktionen von Gittern, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmische Konstruktionen von Gittern will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-25242

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.