Elementary, analytic, and algorithmic number theory: Research inspired by the mathematics of Carl Pomerance

初等数论、解析数论和算法数论：受 Carl Pomerance 数学启发的研究

• 批准号: 1502336
• 负责人: Paul Pollack
• 金额: $ 1.97万
• 依托单位: University of Georgia Research Foundation Inc
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-06-01 至 2016-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1502336&HistoricalAwards=false
• 关键词: Elementary; analytic; algorithmic; number; theory

The conference "Elementary, analytic, and algorithmic number theory: Research inspired by the mathematics of Carl Pomerance" will be held June 9-11, 2015 at the University of Georgia in Athens, GA. The focus of this meeting is on three subfields of number theory: elementary number theory (which studies the basic properties of the natural numbers), analytic number theory (which takes a statistical perspective on these questions), and algorithmic number theory (which investigates how computers can be of assistance in answering number-theoretic questions). These three areas of mathematics are highly interconnected, with results in one area often stemming from progress in the other. While of fundamental theoretical importance, ideas from these fields have also found numerous applications outside of pure mathematics, digital security being a prominent example.The conference will feature six hour-long plenary talks and fourteen invited 30-minute talks by experts in these fields. The talks will highlight the current state of research in these fields and draw attention to the central open problems. On June 8, the day prior the start of the main conference activities, the organizers will host a special day of talks by young researchers. The goal here is to give visibility to up and coming mathematicians and to encourage interchange of ideas - both vertically (among students, junior faculty, and world-class researchers) and horizontally (among researchers in different fields of number theory).For more information see the conference web-site: http://www.math.uga.edu/~cp70/CP70/Home.html

会议“基本的，分析的，和算法数论：由卡尔Pomerance数学启发的研究”将于2015年6月9日至11日在雅典的格鲁吉亚大学举行。 这次会议的重点是数论的三个子领域：初等数论（研究自然数的基本性质），分析数论（对这些问题采取统计观点）和算法数论（研究计算机如何帮助回答数论问题）。数学的这三个领域是高度相互关联的，一个领域的成果往往源于另一个领域的进步。虽然这些领域的思想具有重要的理论意义，但它们在纯数学之外也有许多应用，数字安全就是一个突出的例子。会议将包括6个小时的全体会议和14个由这些领域的专家邀请的30分钟的演讲。会谈将突出这些领域的研究现状，并提请注意核心的开放问题。6月8日，在主要会议活动开始的前一天，组织者将举办一个由年轻研究人员参加的特别讲座日。这里的目标是让未来的数学家和鼓励思想的交流-无论是纵向（学生，初级教师和世界一流的研究人员）和横向（在数论的不同领域的研究人员）。http://www.math.uga.edu/~cp70/CP70/Home.html