arXiv · 2510.26652
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.
Explore related subjects
Keep this discovery
Dayoon Park, Robin Visser, Pavlo Yatsyna, Jongheun Yoon. 2025-10-30. Asymptotics of $n$-universal lattices over number fields. https://arxiv.org/abs/2510.26652
Cite the original work for its findings. Save a collection to share your selection of sources.