权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Algorithmic Number Theory Symposium 2018

2018年算法数论研讨会

基本信息

批准号：
1802687
负责人：
Andrew Shallue
金额：
$ 1万
依托单位：
Illinois Wesleyan University
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2018
资助国家：
美国
起止时间：
2018-05-01 至 2019-04-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1802687&HistoricalAwards=false
关键词：
Algorithmic Number Theory Symposium 2018

项目摘要

This award supports participation in the 2018 Algorithmic Number Theory Symposium (ANTS XIII) held in Madison, Wisconsin on July 16 - 20, 2018. The meeting is part of a biannual research conference series that specializes in problems related to computations on numbers and algorithms that answer questions about numbers. Two examples of such problems are (1) given a number, determine if it is prime or composite and (2) given a composite number, determine its prime factorization. Techniques for solving such problems are the foundation of internet security and digital commerce. Approximately 130 mathematicians participate in each meeting. The research presented will be compiled into a proceedings volume of peer-reviewed papers. For more information, visit http://www.math.grinnell.edu/~paulhusj/ants2018/.The Algorithmic Number Theory Symposium is a leading scientific venue for dissemination and catalysis of novel research in the fields of algorithmic and computational number theory. The meeting is devoted to algorithmic aspects of number theory, including elementary number theory, algebraic number theory, analytic number theory, geometry of numbers, arithmetic algebraic geometry, finite fields, and cryptography. Speakers submit papers that are peer-reviewed, selected through a competitive process, and subsequently compiled into a proceedings volume. Funding is available for graduate students and other early-career mathematicians.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

该奖项支持参加2018年7月16日至20日在威斯康星州麦迪逊举行的2018年数学数论研讨会（ANTS XIII）。这次会议是一年两次的研究会议系列的一部分，该会议专门研究与数字计算和回答数字问题的算法有关的问题。这类问题的两个例子是：（1）给定一个数，确定它是素数还是合数;（2）给定一个合数，确定它的素数分解。解决这些问题的技术是互联网安全和数字商务的基础。每次会议大约有130名数学家参加。提出的研究将被汇编成同行评审论文集。欲了解更多信息，请访问http://www.math.grinnell.edu/~paulhusj/ants2018/.The数学数论研讨会是传播和催化算法和计算数论领域新研究的领先科学场所。会议致力于数论的算法方面，包括初等数论，代数数论，解析数论，几何数，算术代数几何，有限域和密码学。发言者提交的论文经过同行评审，通过竞争程序选出，随后汇编成一卷会议记录。该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。