Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Université de Montréal

$56,000.00

Topics in multiplicative and probabilistic number theory

EF 2022-23

Résumé
Multiplication is one of the main arithmetic operations. Understanding its fine properties leads to surprisingly deep questions, and my research program is largely motivated by them. Multiplicative objects often possess a chaotic, random-like behaviour, so that it is natural to study them from a probabilistic point of view.An important example of a random-like multiplicative object are the primes. These are integers (whole numbers) that cannot be written as product of two other strictly smaller integers. So 2, 3, 5, 7 and 11 are the first few of them. Primes are the "building blocks" of multiplication, since any integer can be written as the product of some of them. Numerical calculations quickly reveal the chaotic nature of primes, with no apparent structure among them. This is one of the main reasons why understanding how primes are distributed among all integers is notoriously hard.A practical way of packaging many questions about primes is to use 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) must 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, thus supplying more examples of "chaotic multiplicative objects". For this reason, we approach them probabilistically and study them on average. Understanding the nature of these averages is one of the main goals of this proposal.Prime numbers have very simple multiplicative structure, with no non-trivial divisors. The situation is completely different for most other integers. Take, for example, 120: its divisors are the numbers 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120. The distribution of the divisors of integers is a key part of this proposal. The divisors of an integer can get very concentrated around certain points, thus forming large clumps. I am particularly interested in understanding how big these clumps can get for a "randomly chosen integer".The final component of my research proposal concerns rational approximations of irrational numbers. Given a set of denominators, I want to understand whether "most" irrational numbers can be approximated using fractions with these denominators. It is conjectured that the answer is yes if our set of denominators is "large enough". As it turns out, the hardest case is when the denominators have common divisors of very specific size. We thus arrive to another kind of multiplicative structure that needs to be studied.
Programme
Discovery Grants Program - Individual
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2018-05699
Name nom
Koukoulopoulos, Dimitrios
Department département
Mathématiques et de statistique - 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
2022
Competition year année de concours
2018
Award amount
56000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR 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
2900
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Pure mathematics
Research subject fr
Mathématiques pures
Installment
inst:5;6
Partie
2
Nb partie
6
Application title
Topics in multiplicative and probabilistic number theory
Application summary
Multiplication is one of the main arithmetic operations. Understanding its fine properties leads to surprisingly deep questions, and my research program is largely motivated by them. Multiplicative objects often possess a chaotic, random-like behaviour, so that it is natural to study them from a probabilistic point of view.An important example of a random-like multiplicative object are the primes. These are integers (whole numbers) that cannot be written as product of two other strictly smaller integers. So 2, 3, 5, 7 and 11 are the first few of them. Primes are the "building blocks" of multiplication, since any integer can be written as the product of some of them. Numerical calculations quickly reveal the chaotic nature of primes, with no apparent structure among them. This is one of the main reasons why understanding how primes are distributed among all integers is notoriously hard.A practical way of packaging many questions about primes is to use 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) must 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, thus supplying more examples of "chaotic multiplicative objects". For this reason, we approach them probabilistically and study them on average. Understanding the nature of these averages is one of the main goals of this proposal.Prime numbers have very simple multiplicative structure, with no non-trivial divisors. The situation is completely different for most other integers. Take, for example, 120: its divisors are the numbers 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120. The distribution of the divisors of integers is a key part of this proposal. The divisors of an integer can get very concentrated around certain points, thus forming large clumps. I am particularly interested in understanding how big these clumps can get for a "randomly chosen integer".The final component of my research proposal concerns rational approximations of irrational numbers. Given a set of denominators, I want to understand whether "most" irrational numbers can be approximated using fractions with these denominators. It is conjectured that the answer is yes if our set of denominators is "large enough". As it turns out, the hardest case is when the denominators have common divisors of very specific size. We thus arrive to another kind of multiplicative structure that needs to be studied.