课题基金 / 基金详情

Topics in Number Theory

Topics in Number Theory
数论专题
批准号:
1001180
负责人:
Carl Pomerance
金额:
$17.0万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2010
资助国家:
美国
项目状态:
已结题
起止时间:
2010-08-15 至 2013-07-31
关键词:

项目摘要

项目成果

Carl Pomerance的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
The PI proposes to extend recent work with Belabas and Bhargava on counting the number of algebraic number fields within the complex numbers of a given degree over the field of rationals, and with the absolute value of the discriminant below a given bound. This work also has an algorithmic side where one counts the exact number and not just a main term with an error estimate. In addition, the PI proposes to study the chaotic behavior of the multiplicative order function. Here one studies the arithmetic function which assigns to an odd natural number the multiplicative order of 2 to this modulus (with obvious generalizations). This function appears intrinsically in many problems, and it has important applications in cryptography. In these projects and others in the proposal, the PI will involve graduate students, undergraduates, and junior faculty, as he has done with success in the past.The rational numbers (fractions) are so basic that they are taught in elementary school. For the past few centuries, number theorists have found natural ways of expanding them to larger domains that involve throwing in roots of particular polynomials. The program to classify these new fields was begun by Gauss over two centuries ago, where he was able to solve the problem for the case where the polynomial has degree two. In the past century we learned how to do this for degree three, and in the past decade for degrees four and five. Building on this work, the PI proposes a deeper study of these fields from a statistical point of view, and also an algorithmic point of view. We have very few hard data in connection with higher degree fields, and the new perspectives for counting them seem ripe for development as computational tools. In addition, the PI proposes to study the lengths of the periods of certain cyclic processes that are important in cryptography. These lengths have chaotic behavior (for nearby parameters, the lengths can be wildly different). There have been certain conjectures proposed for both the normal lengths of these cycles, and the lengths on average. The PI hopes to settle some of these conjectures, perhaps in the negative. In these projects and others in the proposal, the PI will involve undergraduates, graduate students, and junior faculty. The problems proposed are fundamental and some have been studied for centuries. Some of the more recent problems are entwined with cryptography, a topic of great importance in the world's economy.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Topics in combinatorial and algorithmic number theory
  • 批准号:
    0703850
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $0.0万
  • 财政年份:
    2007
  • 负责人:
    Carl Pomerance
  • 依托单位:
Problems in Algorithmic and Combinatorial Number Theory
  • 批准号:
    0401422
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $22.5万
  • 财政年份:
    2004
  • 负责人:
    Carl Pomerance
  • 依托单位:
Topics in Number Theory
Mathematical Sciences: Topics in Analytic and Algorithmic Number Theory
国内基金
海外基金
关于群上的短零和序列及其cross number的研究
  • 批准号:
    11501561
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    18.0万元
  • 批准年份:
    2015
  • 负责人:
    王林林
  • 依托单位: