JYJongheun Yoon
Jongheun Yoon
*This is an algorithmically generated author record based on publicly available information.
Jongheun Yoon has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Dayoon Park
Department of Algebra, Faculty of Mathematics and Physics, Charles University, Praha 8, Czech Republic
1 shared publication - Pavlo Yatsyna
Department of Algebra, Charles University, Faculty of Mathematics and Physics, Praha 8, Czech Republic
1 shared publication - Robin Visser
Faculty of Mathematics and Physics, Department of Algebra, Charles University, Prague, Czech Republic
1 shared publication
Latest Publications
- Open Access
Asymptotics of $n$-universal lattices over number fields
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.Open AccessAsymptotics of $n$-universal lattices over number fields
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.