Dayoon Park
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Dayoon Park has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Ben Kane
Department of Mathematics, The University of Hong Kong, Pokfulam, Hong Kong
2 shared publications - Hiu Chun So
Department of Mathematics, University of Hong Kong, Pokfulam, Hong Kong
2 shared publications - Manav Batavia
Department of Mathematics, Indian Institute of Technology Bombay, Powai, Mumbai, Maharashtra 400076, India
2 shared publications - Muratzhan Kyranbay
Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Kowloon, Hong Kong
2 shared publications - Piyush Varyani
Department of Mathematics, Indian Institute of Technology, Roorkee, Roorkee, Uttarakhand 247667, India
2 shared publications - Sagnik Saha
Department of Mathematics, Indian Institute of Science Education and Research, Thiruvananthapuram, Vithura, Kerala 695551, India
2 shared publications
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. - Open Access
Kitaoka's Conjecture for quadratic fields
We prove that there are at most 13 real quadratic fields that admit a ternary universal quadratic lattice, thus establishing a strong version of Kitaoka's Conjecture for quadratic fields. More generally, we obtain explicit upper bounds on the discriminants of real quadratic fields with a quadratic lattice of rank at most 7 that represents all totally positive multiples of a fixed integer.
Open AccessKitaoka's Conjecture for quadratic fields
We prove that there are at most 13 real quadratic fields that admit a ternary universal quadratic lattice, thus establishing a strong version of Kitaoka's Conjecture for quadratic fields. More generally, we obtain explicit upper bounds on the discriminants of real quadratic fields with a quadratic lattice of rank at most 7 that represents all totally positive multiples of a fixed integer.
- Open Access
- 13 November 2024
- Published by Springer Nature in Research in Number Theory
- Vol. 10 (4) , 1-16
Completing an universal m-gonal form with a closing unary piece
In this paper, we show that for any m-gonal form $$F_m({\textbf{x}})$$ with $$m \ge 12$$ which represents every positive integer up to $$m-4$$ , by putting together with only an unary m-gonal form, we may complete an universal form.- 13 November 2024
- Published by Springer Nature in Research in Number Theory
- Vol. 10 (4) , 1-16
Open AccessCompleting an universal m-gonal form with a closing unary piece
In this paper, we show that for any m-gonal form $$F_m({\textbf{x}})$$ with $$m \ge 12$$ which represents every positive integer up to $$m-4$$ , by putting together with only an unary m-gonal form, we may complete an universal form. - Open Access
- 22 July 2024
- Published by Springer Nature in The Ramanujan Journal
- Vol. 65 (1) , 1-25
Determining universality of m-gonal forms with first five coefficients
We classify the $$(a_1,a_2,a_3,a_4,a_5)$$ for which the universality of an m-gonal form $$F_m({\textbf{x}})$$ whose first five coefficients are $$(a_1,a_2,a_3,a_4,a_5)$$ is characterized as the representabilitiy of positive integers up to $$m-4$$ and discuss some applications.- 22 July 2024
- Published by Springer Nature in The Ramanujan Journal
- Vol. 65 (1) , 1-25
Open AccessDetermining universality of m-gonal forms with first five coefficients
We classify the $$(a_1,a_2,a_3,a_4,a_5)$$ for which the universality of an m-gonal form $$F_m({\textbf{x}})$$ whose first five coefficients are $$(a_1,a_2,a_3,a_4,a_5)$$ is characterized as the representabilitiy of positive integers up to $$m-4$$ and discuss some applications. - 20 July 2020
- Published by Elsevier in Journal of Number Theory
- Vol. 220, 163-181
Fermat's polygonal number theorem for repeated generalized polygonal numbers
- 20 July 2020
- Published by Elsevier in Journal of Number Theory
- Vol. 220, 163-181
Fermat's polygonal number theorem for repeated generalized polygonal numbers
- Open Access
Fermat's polygonal number theorem for repeated generalized polygonal numbers
In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required to represent every positive integer and we furthermore generalize this result to obtain optimal bounds when many of the generalized $m$-gonal numbers are repeated $r$ times, where $r\in\mathbb{N}$ is fixed.Open AccessFermat's polygonal number theorem for repeated generalized polygonal numbers
In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required to represent every positive integer and we furthermore generalize this result to obtain optimal bounds when many of the generalized $m$-gonal numbers are repeated $r$ times, where $r\in\mathbb{N}$ is fixed. - 5 September 2019
- Published by Springer Nature in The Ramanujan Journal
- Vol. 52 (2) , 445-458
Binary quadratic forms represented by sums of squares in an essentially unique way
- 5 September 2019
- Published by Springer Nature in The Ramanujan Journal
- Vol. 52 (2) , 445-458
Binary quadratic forms represented by sums of squares in an essentially unique way