Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$29,000.00

Explicit methods in arithmetic geometry

EF 2013-14

Résumé
A large part of the mathematical sciences is concerned with developing methods for finding solutions to various types of equations. The simplest kind of equation is the polynomial equation, where the variables are combined using just addition and multiplication. This is the oldest type of equation that was ever studied. One calls such an equation a Diophantine equation if one restricts to solutions that are natural numbers, integers, or rational numbers. Equations like this come up in many practical situations, such as in resonance problems, translating election results into seat distributions, and various questions about discrete configurations. In general, it is a very hard problem to decide if a polynomial equation has an integer valued solution. In fact, it has been proved, in response to a challenge that Hilbert set in 1900, that it is fundamentally impossible to create a general algorithm (computer program) that decides if there is an integral solution to a given polynomial equation. In contrast, the answer to the similar problem for rational solutions is unknown. For a special class of equations called curves, recent work has resulted in a method that can often decide whether there are any rational solutions in practice. We even have some reason to believe that the method might actually always work. This research program aims to improve our understanding of the rational solutions of polynomial equations. It will develop new and improve existing methods for deciding if there are any solutions at all and to determine all solutions if they exist.
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
261486-2013
Name nom
Bruin, Nils
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
2013
Award amount
29000
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
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
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
1
Nb partie
5
Application title
Explicit methods in arithmetic geometry
Keyword
NSERC
Application summary
A large part of the mathematical sciences is concerned with developing methods for finding solutions to various types of equations. The simplest kind of equation is the polynomial equation, where the variables are combined using just addition and multiplication. This is the oldest type of equation that was ever studied. One calls such an equation a Diophantine equation if one restricts to solutions that are natural numbers, integers, or rational numbers. Equations like this come up in many practical situations, such as in resonance problems, translating election results into seat distributions, and various questions about discrete configurations. In general, it is a very hard problem to decide if a polynomial equation has an integer valued solution. In fact, it has been proved, in response to a challenge that Hilbert set in 1900, that it is fundamentally impossible to create a general algorithm (computer program) that decides if there is an integral solution to a given polynomial equation. In contrast, the answer to the similar problem for rational solutions is unknown. For a special class of equations called curves, recent work has resulted in a method that can often decide whether there are any rational solutions in practice. We even have some reason to believe that the method might actually always work. This research program aims to improve our understanding of the rational solutions of polynomial equations. It will develop new and improve existing methods for deciding if there are any solutions at all and to determine all solutions if they exist.