Combinatorics and Asymptotics of Structure Constants from Representation Theory and Algebra

来自表示论和代数的结构常数的组合学和渐近学

• 批准号: 1939717
• 负责人: Greta Panova
• 金额: $ 15万
• 依托单位: University of Southern California
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2019
• 资助国家: 美国
• 起止时间: 2019-07-01 至 2021-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1939717&HistoricalAwards=false
• 关键词: Combinatorics; Asymptotics; Structure; Constants; Representation

Symmetries and patterns capture the essence of our complex world and give the abstraction necessary to study it with algebraic and discrete methods. As objects change and interact, so do the inherent symmetries. How do symmetries combine, restrict, project or transform into other symmetries? How do we decompose a complex system of irreducible components? In general we want to describe this interaction quantitatively -- how many components of each type are contained in another bigger symmetry structure. While the computational complexity of the problem in general hints that no "closed-form" answer would exist, it is the goal of this project to find these numbers approximately and see how a typical structure looks like. These problems appear in many disguises, and lie at the intersection of combinatorics, algebra, representation theory, probability and statistical mechanics, and computational complexity theory. More precisely, the PI aims to solve problems in algebraic combinatorics involving "structure constants" and Young tableaux. Structure constants are generally defined as the multiplicities of irreducible symmetric or general linear group representations in the decomposition of tensor products or compositions, or, more generally, the nonnegtive integral coefficients in the decomposition of various symmetric functions in certain bases. The PI aims to determine the behavior of such constants -- asymptotics, positivity, relation to each other, combinatorial interpretation. Among the flagship problems and ultimate goals are: combinatorial interpretation for the Kronecker and plethysm coefficients, Foulkes' conjecture on the relative order of plethysm coefficients, asymptotics of Littlewood-Richardson and Kronecker coefficients, the asymptotic number of skew (semi)Standard Young tableaux in various growth regimes for the parameters, limit behavior of lozenge tilings of "skew" (general, nontrapezoidal) domains, inequalities of multiplicities in Geometric complexity Theory leading to obstructions distinguishing between polynomials, positivity of e-expansions for q-analogues of chromatic symmetric functions and Schur positivity for LLT polynomials. The methods range from extension of existing approaches in the PI's work, to further combination with methods from statistical mechanics like the variational principle, enumeration via large deviations, algebro-geometric interpretations, etc.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.

对称性和模式抓住了我们复杂世界的本质，并给出了用代数和离散方法研究它所必需的抽象。随着物体的变化和相互作用，固有的对称性也在变化。对称性如何联合收割机、限制、投射或转化成其他对称性？我们如何分解一个由不可约成分组成的复杂系统？一般来说，我们想定量地描述这种相互作用--在另一个更大的对称结构中包含了多少种类型的成分。虽然该问题的计算复杂性总体上表明不存在“封闭形式”的答案，但该项目的目标是近似地找到这些数字并查看典型结构是什么样子。这些问题以许多伪装出现，并且位于组合学、代数、表示论、概率和统计力学以及计算复杂性理论的交叉点。更确切地说，PI旨在解决代数组合学中涉及“结构常数”和Young tableaux的问题。结构常数通常定义为不可约对称或一般线性群表示在张量积或合成分解中的重数，或者更一般地，在某些基中各种对称函数分解中的非连续积分系数。PI的目的是确定这些常数的行为-渐近性，积极性，相互关系，组合解释。主要问题和最终目标包括：Kronecker和体积系数的组合解释，体积系数相对阶的Foulkes猜想，Littlewood-Richardson和Kronecker系数的渐近性，参数在不同生长状态下的斜（半）标准Young表的渐近数，“斜”菱形镶嵌的极限行为。（一般，非梯形）域、几何复杂性理论中的多重性不等式导致区分多项式的障碍、色对称函数的q-类似物的e-展开式的正性和LLT多项式的Schur正性。方法范围从PI工作中现有方法的扩展，到与统计力学方法的进一步结合，如变分原理，通过大偏差枚举，代数几何解释等。该奖项反映了NSF的法定使命，并被认为值得通过使用基金会的智力价值和更广泛的影响审查标准进行评估来支持。

项目成果

Bounds on Kronecker coefficients via contingency tables

通过列联表确定克罗内克系数的界限

• DOI: 10.1016/j.laa.2020.05.005
• 发表时间: 2020
• 期刊: Linear Algebra and its Applications
• 影响因子: 1.1
• 作者: Pak, Igor;Panova, Greta
• 通讯作者: Panova, Greta

Sorting probability of Catalan posets

加泰罗尼亚偏序集的排序概率

• DOI: 10.1016/j.aam.2021.102221
• 发表时间: 2021
• 期刊: Advances in Applied Mathematics
• 影响因子: 1.1
• 作者: Chan, Swee Hong;Pak, Igor;Panova, Greta
• 通讯作者: Panova, Greta

Sorting probability for large Young diagrams

大型杨氏图的排序概率

• DOI: 10.19086/da.30071
• 发表时间: 2021
• 期刊: Discrete analysis
• 影响因子: 1.1
• 作者: Swee Hong Chan, Igor Pak

Counting Partitions inside a Rectangle

• DOI: 10.1137/20m1315828
• 发表时间: 2018-05
• 期刊: SIAM J. Discret. Math.
• 作者: S. Melczer;G. Panova;Robin Pemantle

Chromatic symmetric functions of Dyck paths and q -rook theory

Dyck路径的色对称函数和q-rook理论

• DOI: 10.1016/j.ejc.2022.103595
• 发表时间: 2023
• 期刊: European Journal of Combinatorics
• 影响因子: 1
• 作者: Colmenarejo, Laura;Morales, Alejandro H.;Panova, Greta
• 通讯作者: Panova, Greta