Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$17,000.00

Arithmetic Properties of Function Fields

EF 2017-18

Résumé
My research area is number theory. An important subject in number theory is the ring of polynomials over a finite field, called a function field. It bears a close resemblance to the ring of integers. Many results about integers can be asked of these analogues. One example is the multi-dimensional Waring?s problem. For any positive integers s, k and n, let R_s,k(n) be the number of representations of the positive integer n as the sum of s kth powers of positive integers. It is widely expected that when k>2 and s>k, R_s,k(n) has an asymptotic formula. Let u(k) be the smallest value s such that R_s,k(n) has an asymptotic formula. G. H. Hardy and J. E. Littlewood were the first to obtain the bound 2k^2+2k-3 for u(k). Since then, the upper bound of u(k) has been improved by many people. This problem has been formulated in the multi-dimensional setting over the integers by S. T. Parsell. I would like to sharpen the upper bound of u(k) in the function field case, by adopting the efficient congruencing method in function fields, invented by T. D. Wooley. A second example is a Sidon sequence. Given a sequence of positive integers A, we say that A is a Sidon set if for all a, a? in A, a+a? are distinct. A Sidon set A is called a Sidon basis of order h if any positive integer n can be written as a sum of h elements of A. S. Sidon introduced this concept in his work in Fourier analysis, to investigate certain power series with bounded coefficients. P. Erdos conjectured that there is a Sidon basis of order 3. This conjecture is still open today. We can ask the same question for function fields. My goal is to use probabilistic methods to prove that Erdos? conjecture and other related questions hold for the function field case. A third class of examples are problems in Drinfeld modules. The study of elliptic curves is important in modern number theory. Drinfeld modules are the function field analogue of elliptic curves. V. Drinfeld first introduced this subject to solve the Langlands conjecture in function fields, and was awarded the Fields medal for his work. Many questions in elliptic curves can be formulated in the Drinfeld module setting. I plan to study Koblitz's conjecture and Erdos-Pomerance?s conjecture on Drinfeld modules. These two conjectures regard probabilistic properties of Drinfeld modules whose elliptic curve analogues have not been proved yet. My work on them will shed light on the original conjectures on elliptic curves. There are many questions in number theory that are suitable for training different levels of students. At the entry level, students can start with problems in the classical setting and then conduct numerical experiments for the analogue problems with the function field setting. More sophisticated and talented students can study the numerical data to make conjectures, or even prove them. Many students have been successful under my training.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2015-03709
Name nom
Kuo, Wentang
Department département
Pure Mathematics - Pure Mathematics
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2015
Award amount
17000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2913
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Number theory
Research subject fr
Théorie des nombres
Partie
3
Nb partie
5
Application title
Arithmetic Properties of Function Fields
Keyword
NSERC
Application summary
My research area is number theory. An important subject in number theory is the ring of polynomials over a finite field, called a function field. It bears a close resemblance to the ring of integers. Many results about integers can be asked of these analogues. One example is the multi-dimensional Waring?s problem. For any positive integers s, k and n, let R_s,k(n) be the number of representations of the positive integer n as the sum of s kth powers of positive integers. It is widely expected that when k>2 and s>k, R_s,k(n) has an asymptotic formula. Let u(k) be the smallest value s such that R_s,k(n) has an asymptotic formula. G. H. Hardy and J. E. Littlewood were the first to obtain the bound 2k^2+2k-3 for u(k). Since then, the upper bound of u(k) has been improved by many people. This problem has been formulated in the multi-dimensional setting over the integers by S. T. Parsell. I would like to sharpen the upper bound of u(k) in the function field case, by adopting the efficient congruencing method in function fields, invented by T. D. Wooley. A second example is a Sidon sequence. Given a sequence of positive integers A, we say that A is a Sidon set if for all a, a? in A, a+a? are distinct. A Sidon set A is called a Sidon basis of order h if any positive integer n can be written as a sum of h elements of A. S. Sidon introduced this concept in his work in Fourier analysis, to investigate certain power series with bounded coefficients. P. Erdos conjectured that there is a Sidon basis of order 3. This conjecture is still open today. We can ask the same question for function fields. My goal is to use probabilistic methods to prove that Erdos? conjecture and other related questions hold for the function field case. A third class of examples are problems in Drinfeld modules. The study of elliptic curves is important in modern number theory. Drinfeld modules are the function field analogue of elliptic curves. V. Drinfeld first introduced this subject to solve the Langlands conjecture in function fields, and was awarded the Fields medal for his work. Many questions in elliptic curves can be formulated in the Drinfeld module setting. I plan to study Koblitz's conjecture and Erdos-Pomerance?s conjecture on Drinfeld modules. These two conjectures regard probabilistic properties of Drinfeld modules whose elliptic curve analogues have not been proved yet. My work on them will shed light on the original conjectures on elliptic curves. There are many questions in number theory that are suitable for training different levels of students. At the entry level, students can start with problems in the classical setting and then conduct numerical experiments for the analogue problems with the function field setting. More sophisticated and talented students can study the numerical data to make conjectures, or even prove them. Many students have been successful under my training.