Grant: Discovery Grants Program - Individual
Université de Montréal
$20,000.00
Distribution of multiplicative functions and other topics in analytic number theory
EF 2015-16
Résumé
Multiplication is one of the main arithmetic operations. Understanding fine properties of this simple operation leads to surprisingly deep questions. For example, the prime numbers are integers (whole numbers) that cannot be written as product of two other, strictly smaller integers. So 2, 3, 5, 7, 11, ... are prime numbers. These special integers are the 'building blocks' of multiplication, since any integer can be written as the product of prime numbers. Understanding the distribution of prime numbers among the set of all integers, as well as among other special subsets of the integers, is one of the most sought questions in mathematics.
A practical way of packaging many questions concerning the prime numbers and, more generally, multiplication, is by using multiplicative functions. These are functions that respect the multiplicative structure of the integers. For example, 6 = 2 x 3, so if f is a multiplicative function and we input 6, 2 and 3 to it, the outputs f(6), f(2) and f(3) will have to obey the same multiplicative law: f(6) = f(2) x f(3). Often, inputing different integers to a multiplicative function can produce outputs that vary unpredictably. But if we average these outputs over many inputs, then the irregularities are smoothened out and we can start asking various questions. Perhaps the single most important question is how big this mean value is. This problem becomes of particular interest and difficulty when our function does not assume only positive or only negative values but, instead, it jumps back and forth between positive and negative values. How do we know then if these values of opposite signs cancel each other? Understanding questions of this flavour is a major part of my research.
Prime numbers are so fundamental that it is possible to find them in front of you in the most surprising places. Elliptic curves are neither curves nor elliptical. Rather, they are donut-like surfaces which possess several remarkable properties. In particular, it is possible to define an operation on their points, much like we define multiplication on the integers. Studying what symmetries this operation can give rise to, led us naturally to questions about the distribution of prime numbers inside an arithmetic progression (e.g. in 4,7,10,...)
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
435272-2013
Name nom
Koukoulopoulos, Dimitrios
Department département
Mathématiques et de statistique
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2013
Award amount
20000
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
Distribution of multiplicative functions and other topics in analytic number theory
Keyword
NSERC
Application summary
Multiplication is one of the main arithmetic operations. Understanding fine properties of this simple operation leads to surprisingly deep questions. For example, the prime numbers are integers (whole numbers) that cannot be written as product of two other, strictly smaller integers. So 2, 3, 5, 7, 11, ... are prime numbers. These special integers are the 'building blocks' of multiplication, since any integer can be written as the product of prime numbers. Understanding the distribution of prime numbers among the set of all integers, as well as among other special subsets of the integers, is one of the most sought questions in mathematics.
A practical way of packaging many questions concerning the prime numbers and, more generally, multiplication, is by using multiplicative functions. These are functions that respect the multiplicative structure of the integers. For example, 6 = 2 x 3, so if f is a multiplicative function and we input 6, 2 and 3 to it, the outputs f(6), f(2) and f(3) will have to obey the same multiplicative law: f(6) = f(2) x f(3). Often, inputing different integers to a multiplicative function can produce outputs that vary unpredictably. But if we average these outputs over many inputs, then the irregularities are smoothened out and we can start asking various questions. Perhaps the single most important question is how big this mean value is. This problem becomes of particular interest and difficulty when our function does not assume only positive or only negative values but, instead, it jumps back and forth between positive and negative values. How do we know then if these values of opposite signs cancel each other? Understanding questions of this flavour is a major part of my research.
Prime numbers are so fundamental that it is possible to find them in front of you in the most surprising places. Elliptic curves are neither curves nor elliptical. Rather, they are donut-like surfaces which possess several remarkable properties. In particular, it is possible to define an operation on their points, much like we define multiplication on the integers. Studying what symmetries this operation can give rise to, led us naturally to questions about the distribution of prime numbers inside an arithmetic progression (e.g. in 4,7,10,...)