Stephen Choi, Professor
Ph.D. Mathematics · University of Texas at Austin · 1996
SC K10529 | schoia@sfu.ca
Ph.D. Mathematics · University of Texas at Austin · 1996
SC K10529 | schoia@sfu.ca
My research interests are Diophantine approximations, Diophantine equations, Goldbach-Waring problem, polynomials with restricted coefficients and merit factors of binary sequences. Solving Diophantine equations is one of the most fundamental and important problems in number theory. For example, the famous Fermat Last problem is to solve the Diophantine equation x^{n} + y^{n} = z^{n} for integer exponent n and integer unknowns x, y, z. Another famous example is the Waring problem which investigates the integer solutions x_{1}, x_{2}, …, x_{s} for the diagonal Diophantine equation
x_{1}^{k} + x_{2}^{k} + … + x_{s}^{k} = b
for constant integer b ≥ 1 and exponent k ≥ 2. In other words, the Waring problem studies representations of integers in a sum of fixed power of integers. Solving Diophantine equations over some special and interesting subsets of integers is also fascinating and attractive to number theorists. In particular, people are interested in considering prime solutions of Diophantine equations. The most famous problem of this type of study is the Goldbach problem which asks if every even integer greater than 5 can be written as a sum of two primes, that is, to solve the Diophantine equations p_{1} + p_{2} = b for even integer b and prime unknowns p_{1} and p_{2}. One area of my research work is considering the problem of the combination of both the Goldbach and Waring problems by studying the diagonal Diophantine equations
a_{1}p_{1}^{k} + a_{2}p_{2}^{k} + … + a_{s}p_{s}^{k} = b
where a_{i} are integer coefficients and p_{i} are prime unknowns. This is called the Goldbach-Waring problem. One of the goals in my research is to prove the solubility of the prime variables of the above Goldbach-Waring equations that do not grow too rapidly as the coefficients grow to infinity by using analytic method such as the Hardy and Littlewood circle method. Polynomials are fundamental objects in many branches in Mathematics. They pervade Mathematics. In particular, the study of polynomials with integer coefficients is fundamental and important and is always one of the core areas in number theory. Polynomials with coefficients restricted to some special and interesting subsets of integers are also fascinating and draw much interest. The simplest subset is the binary set {-1, 1}. In particular, people are interested in studying polynomials with coefficients +1 or -1. We call these polynomials Littlewood Polynomials. One can view Littlewood polynomials as finite binary sequences as the natural association of their coefficients to finite binary sequences. Undoubtedly, this kind of polynomials is also fascinating and attractive in other fields such as combinatorics and the information theory, etc. The problems concern polynomials typically ask something about the size of the polynomials with an appropriate measure of size and often with some restriction on the coefficients and degree. We are particularly interested in studying the behaviour of the L_{4} norms over the unit circle of Littlewood polynomials. More specifically, one may want to know how small the L_{4} norm of Littlewood polynomials can be. This is still an open question if there is non-trivial lower bound for the L_{4} norm of Littlewood polynomials of given degree. This problem is closely related to the longstanding open problem raised by Littlewood and Erdös about the existence of the ultra flat Littlewood polynomials. All these problems are still wide open. One of research interests is to investigate and search for those Littlewood polynomials with very smallL_{4} norms. This study is closely related to the problem of finding the so-called easily identifiable binary sequences in information and communication theory.
F T I