Asymptotics of $n$-universal lattices over number fields

Abstract

We prove an explicit asymptotic formula for the logarithm of the minimal ranks of $n$-universal lattices over the ring of integers of totally real number fields. We also show that, for any constant $C > 0$ and $n \geq 3$, there are only finitely many totally real fields with an $n$-universal lattice of rank at most $C$, with all such fields being effectively computable. Similarly, for any $n \geq 3$, we show that there are only finitely many totally real fields admitting an $n$-universal criterion set of size at most $C$, with all such fields likewise being effectively computable.