{"id":{"repo_id":"toronto-retro","oai_identifier":"oai:utoronto.scholaris.ca:1807/92056"},"canonical_url":"https://search.dev.ndltd.org/etd/toronto-retro/oai:utoronto.scholaris.ca:1807/92056","repository":{"repo_id":"toronto-retro","name":"University of Toronto","base_url":"https://utoronto.scholaris.ca/server/oai/request"},"display":{"title":"Topics in Multiplicative and Probabilistic Number Theory","abstract":"A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneously be additively and multiplicatively structured. The practical verification of this heuristic is the source of a great number of difficult problems, including the well-known Hardy-Littlewood tuples conjecture. Conjectures of this type are also at least morally equivalent to the expectation that a generic multiplicative function behaves randomly on additively structured sets. In this thesis, we consider several problems involving the behaviour of multiplicative functions interacting with additively structured sets. First, we prove quantitative versions of mean value theorems due to Wirsing and Halász for multiplicative functions that often take values outside of the unit disc, and provide some applications of this result to probabilistic number theory. In a different direction, we refine a quantitative mean value theorem for multiplicative functions, and thereby significantly improve the existing upper bounds on the maximum size of partial sums of odd order non-principal Dirichlet characters, both unconditionally and assuming the Generalized Riemann Hypothesis, and show that our conditional results are nearly best possible unconditionally. We also prove a quantitative bivariate Erdo&huml;s-Kac theorem on the joint distribution of pairs of values of certain additive functions, and use this probabilistic result to derive a weak version of Chowla's conjecture on binary correlations of the Möbius function, among other applications. Solving a 60-year-old open problem of N.G. Chudakov, we show that a completely multiplicative function that only takes finitely many values, vanishes at only finitely many primes and whose partial sums are uniformly bounded, must be a non-principal Dirichlet character. We also solve a folklore conjecture due to Elliott, Ruzsa and others on the gaps between consecutive values of a unimodular completely multiplicative function, showing that these gaps cannot be uniformly large. This latter result is a corollary of several stronger results that are proved regarding the distribution of consecutive values of multiplicative functions. Finally, we make some progress on some natural variants of Chowla's conjecture on sign patterns of the {+1, –1}-valued multiplicative functions. Some of the aforementioned results are joint work with O. Klurman, or with Y. Lamzouri.","abstract_html":"A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneously be additively and multiplicatively structured. The practical verification of this heuristic is the source of a great number of difficult problems, including the well-known Hardy-Littlewood tuples conjecture. Conjectures of this type are also at least morally equivalent to the expectation that a generic multiplicative function behaves randomly on additively structured sets. In this thesis, we consider several problems involving the behaviour of multiplicative functions interacting with additively structured sets. First, we prove quantitative versions of mean value theorems due to Wirsing and Halász for multiplicative functions that often take values outside of the unit disc, and provide some applications of this result to probabilistic number theory. In a different direction, we refine a quantitative mean value theorem for multiplicative functions, and thereby significantly improve the existing upper bounds on the maximum size of partial sums of odd order non-principal Dirichlet characters, both unconditionally and assuming the Generalized Riemann Hypothesis, and show that our conditional results are nearly best possible unconditionally. We also prove a quantitative bivariate Erdo&huml;s-Kac theorem on the joint distribution of pairs of values of certain additive functions, and use this probabilistic result to derive a weak version of Chowla's conjecture on binary correlations of the Möbius function, among other applications. Solving a 60-year-old open problem of N.G. Chudakov, we show that a completely multiplicative function that only takes finitely many values, vanishes at only finitely many primes and whose partial sums are uniformly bounded, must be a non-principal Dirichlet character. We also solve a folklore conjecture due to Elliott, Ruzsa and others on the gaps between consecutive values of a unimodular completely multiplicative function, showing that these gaps cannot be uniformly large. This latter result is a corollary of several stronger results that are proved regarding the distribution of consecutive values of multiplicative functions. Finally, we make some progress on some natural variants of Chowla's conjecture on sign patterns of the {+1, –1}-valued multiplicative functions. Some of the aforementioned results are joint work with O. Klurman, or with Y. Lamzouri.","abstract_has_math":false,"creators":["Mangerel, Alexander"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics","school":null,"contributors":[],"advisors":["Friedlander, John B"],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018-11","date_published":"2018-11","updated_at":"2026-07-27T21:27:56Z","subjects":["Correlations","Dirichlet Characters","Mean Value Theorems","Multiplicative Functions","Probabilistic Number Theory"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1807/92056","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Friedlander, John B"]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Mangerel, Alexander"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2018-11"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-11-19T18:03:57Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-11-19T18:03:57Z"]},{"key":"dc:date.issued","label":"Date","values":["2018-11"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Correlations","Dirichlet Characters","Mean Value Theorems","Multiplicative Functions","Probabilistic Number Theory"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1807/92056"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneously be additively and multiplicatively structured. The practical verification of this heuristic is the source of a great number of difficult problems, including the well-known Hardy-Littlewood tuples conjecture. Conjectures of this type are also at least morally equivalent to the expectation that a generic multiplicative function behaves randomly on additively structured sets. In this thesis, we consider several problems involving the behaviour of multiplicative functions interacting with additively structured sets. First, we prove quantitative versions of mean value theorems due to Wirsing and Halász for multiplicative functions that often take values outside of the unit disc, and provide some applications of this result to probabilistic number theory. In a different direction, we refine a quantitative mean value theorem for multiplicative functions, and thereby significantly improve the existing upper bounds on the maximum size of partial sums of odd order non-principal Dirichlet characters, both unconditionally and assuming the Generalized Riemann Hypothesis, and show that our conditional results are nearly best possible unconditionally. We also prove a quantitative bivariate Erdo&huml;s-Kac theorem on the joint distribution of pairs of values of certain additive functions, and use this probabilistic result to derive a weak version of Chowla's conjecture on binary correlations of the Möbius function, among other applications. Solving a 60-year-old open problem of N.G. Chudakov, we show that a completely multiplicative function that only takes finitely many values, vanishes at only finitely many primes and whose partial sums are uniformly bounded, must be a non-principal Dirichlet character. We also solve a folklore conjecture due to Elliott, Ruzsa and others on the gaps between consecutive values of a unimodular completely multiplicative function, showing that these gaps cannot be uniformly large. This latter result is a corollary of several stronger results that are proved regarding the distribution of consecutive values of multiplicative functions. Finally, we make some progress on some natural variants of Chowla's conjecture on sign patterns of the {+1, –1}-valued multiplicative functions. Some of the aforementioned results are joint work with O. Klurman, or with Y. Lamzouri."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["Topics in Multiplicative and Probabilistic Number Theory"]}]}],"canonical_facts":{"dc:contributor.advisor":["Friedlander, John B"],"dc:contributor.department":["Mathematics"],"dc:creator":["Mangerel, Alexander"],"dc:date":["2018-11"],"dc:date.accessioned":["2018-11-19T18:03:57Z"],"dc:date.available":["2018-11-19T18:03:57Z"],"dc:date.issued":["2018-11"],"dc:description.abstract":["A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneously be additively and multiplicatively structured. The practical verification of this heuristic is the source of a great number of difficult problems, including the well-known Hardy-Littlewood tuples conjecture. Conjectures of this type are also at least morally equivalent to the expectation that a generic multiplicative function behaves randomly on additively structured sets. In this thesis, we consider several problems involving the behaviour of multiplicative functions interacting with additively structured sets. First, we prove quantitative versions of mean value theorems due to Wirsing and Halász for multiplicative functions that often take values outside of the unit disc, and provide some applications of this result to probabilistic number theory. In a different direction, we refine a quantitative mean value theorem for multiplicative functions, and thereby significantly improve the existing upper bounds on the maximum size of partial sums of odd order non-principal Dirichlet characters, both unconditionally and assuming the Generalized Riemann Hypothesis, and show that our conditional results are nearly best possible unconditionally. We also prove a quantitative bivariate Erdo&huml;s-Kac theorem on the joint distribution of pairs of values of certain additive functions, and use this probabilistic result to derive a weak version of Chowla's conjecture on binary correlations of the Möbius function, among other applications. Solving a 60-year-old open problem of N.G. Chudakov, we show that a completely multiplicative function that only takes finitely many values, vanishes at only finitely many primes and whose partial sums are uniformly bounded, must be a non-principal Dirichlet character. We also solve a folklore conjecture due to Elliott, Ruzsa and others on the gaps between consecutive values of a unimodular completely multiplicative function, showing that these gaps cannot be uniformly large. This latter result is a corollary of several stronger results that are proved regarding the distribution of consecutive values of multiplicative functions. Finally, we make some progress on some natural variants of Chowla's conjecture on sign patterns of the {+1, –1}-valued multiplicative functions. Some of the aforementioned results are joint work with O. Klurman, or with Y. Lamzouri."],"dc:description.degree":["Ph.D."],"dc:identifier.uri":["http://hdl.handle.net/1807/92056"],"dc:subject":["Correlations","Dirichlet Characters","Mean Value Theorems","Multiplicative Functions","Probabilistic Number Theory"],"dc:title":["Topics in Multiplicative and Probabilistic Number Theory"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T21:27:56Z"}