The Combinatorics & Asymptotics of Sequences of Characters of Symmetric Groups

组合学

• 批准号: 9401197
• 负责人: Amitai Regev
• 金额: $ 6.04万
• 依托单位: Pennsylvania State Univ University Park
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-05-15 至 1997-04-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9401197&HistoricalAwards=false
• 关键词: Combinatorics; & Asymptotics; Sequences; Characters

9401197 Regev This award funds the research of Prof. Amitai Regev in algebraic combinatorics. Prof. Regev will study the asympotics of character sequences, PI algebras and Kronecker products. This work has implication for combinatorics, representation theory and algebra. This research falls in the broad category of combinatorics, which is one of the most active fields in today's mathematics. At its roots, combinatorics is the study of systematic counting. Counting can be incredibly difficult when the objects are difficult to list, and combinatorists look for general methods for overcoming these difficulties. Today's combinatorics makes use of a wide variety of the most advanced and modern mathematical techniques. Although its roots go back several centuries, the field has had an explosive development in the past few decades. This growth comes from its importance in communications and information technology and from the success of modern techniques to problems of counting.

9401197该奖项资助Amitai Regev教授在代数组合学方面的研究。Regev教授将研究字符序列、PI代数和Kronecker积的渐近性。这一工作对组合学、表示理论和代数都有启示意义。这项研究属于组合学的广泛范畴，这是当今数学中最活跃的领域之一。从根本上说，组合学是对系统计数的研究。当对象难以列出时，计数可能会非常困难，组合学家会寻找克服这些困难的通用方法。今天的组合学利用了各种最先进和现代的数学技术。虽然它的根源可以追溯到几个世纪以前，但在过去的几十年里，这个领域有了爆炸性的发展。这种增长来自于它在通信和信息技术中的重要性，以及现代技术在计数问题上的成功。