Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$15,000.00

Some problems in analytic and computational number theory

EF 2013-14

Résumé
The proposal considers two types of problems in number theory. The first type of problems is to study an extension to the Brun-Titchmarsh Theorem. Siegel-Walfisz proved their famous theorem that primes up to x in the arithmetic progress (AP) distribute uniformly among all l when gcd(l,q)=1 and q < (log x)^A. In usual application, such a short range of q compared to x creates problems. Brun and Titchmarsh prove that the number of primes to x in the AP is bounded above by 1/q of the numbers of primes up to x, for the whole range of q < x. In this project, we consider an extension to Brun-Tichmarsh Theorem by replacing the primes numbers by the numbers with at most s prime factors. Recently, Chan, Tsang and the proposal were able to obtain an analogous Brun-Titichmarsh Theorem for numbers with at most s prime factors for the range q < x and 0 < s < loglog(x/q). We also obtain some best possible result for this range of s. One aim of this proposal is to improve our result to the other ranges of s and to more general numbers instead of prime numbers or numbers with fixed number of prime factors. The second type of problems is to study the growth of L4 norm of Littlewood polynomials, i.e. polynomials with +1 or -1 coefficients. This is a continuation of my long term project in studying the Littlewood polynomial and the ultimate goal is to prove or disprove the Littlewood conjecture which states the existence of ultra flat Littlewood polynomials. So far no non-trivial lower bound for L4 norm of Littlewood polynomials has been found and the best sequence of Littlewood polynomials having small L4 norm is Turyn polynomials which are obtained from rotating the Legendre sequence by its quarter of length. Borwein, Jedwab and the proposer perform a vast computations and suggest new sequences of Littlewood polynomials with smaller L4 norm than Turyn polynomials. Some conjectures of the exact evaluation of the L4 norm for these polynomials are also made. They are strongly suggested by the data and closely related to the distribution of the legendre symbol. One aim is to prove this conjecture and hope this will shed light on the proof of Littlewood conjecture.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
238850-2010
Name nom
Choi, StephenKwokKwong
Department département
Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2010
Award amount
15000
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
4
Nb partie
5
Application title
Some problems in analytic and computational number theory
Keyword
NSERC
Application summary
The proposal considers two types of problems in number theory. The first type of problems is to study an extension to the Brun-Titchmarsh Theorem. Siegel-Walfisz proved their famous theorem that primes up to x in the arithmetic progress (AP) distribute uniformly among all l when gcd(l,q)=1 and q < (log x)^A. In usual application, such a short range of q compared to x creates problems. Brun and Titchmarsh prove that the number of primes to x in the AP is bounded above by 1/q of the numbers of primes up to x, for the whole range of q < x. In this project, we consider an extension to Brun-Tichmarsh Theorem by replacing the primes numbers by the numbers with at most s prime factors. Recently, Chan, Tsang and the proposal were able to obtain an analogous Brun-Titichmarsh Theorem for numbers with at most s prime factors for the range q < x and 0 < s < loglog(x/q). We also obtain some best possible result for this range of s. One aim of this proposal is to improve our result to the other ranges of s and to more general numbers instead of prime numbers or numbers with fixed number of prime factors. The second type of problems is to study the growth of L4 norm of Littlewood polynomials, i.e. polynomials with +1 or -1 coefficients. This is a continuation of my long term project in studying the Littlewood polynomial and the ultimate goal is to prove or disprove the Littlewood conjecture which states the existence of ultra flat Littlewood polynomials. So far no non-trivial lower bound for L4 norm of Littlewood polynomials has been found and the best sequence of Littlewood polynomials having small L4 norm is Turyn polynomials which are obtained from rotating the Legendre sequence by its quarter of length. Borwein, Jedwab and the proposer perform a vast computations and suggest new sequences of Littlewood polynomials with smaller L4 norm than Turyn polynomials. Some conjectures of the exact evaluation of the L4 norm for these polynomials are also made. They are strongly suggested by the data and closely related to the distribution of the legendre symbol. One aim is to prove this conjecture and hope this will shed light on the proof of Littlewood conjecture.