A search program for finding optimal integration lattices (Q1180341)

The authors prove several theorems which are useful to effectively search for optimal integration lattices. 40 new good three-dimensional lattices of order less than or equal to 4,000 are found. The search algorithm is designed to find those integer lattices \(\Lambda\) of order \(N\) whose Zaremba index \(\rho(\Lambda)\) is a maximum, \(\rho(N)=\max\rho(\Lambda)\). Let \(L_ s(N)\) be the set of all \(s\) dimensional lattices of order \(N\). \(L_ s(N)\) may be partitioned into equivalence classes in each of which \(\rho(\Lambda)\) is constant. An ordering is introduced into each equivalence class, the maximal elements being called ``seniors''. The search program produces one or more senior lattices for each equivalence class and a lattice \(\Lambda\) such that \(\rho(\Lambda)=\rho(N)\) is identified from among these. The theorems presented in the paper establish properties of the senior lattices which are used to identify them and to determine whether they are equivalent.