arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.1869math.RT
收藏

渐近表示论中的一些数值和算法问题

Some numerical and algorithmical probelms in the asymptotic representation theory

Anatoly Vershik, Dmitry Pavlov

摘要:

本文给出了计算与Young图有关的统计值的实验结果,包括对称群$S_n$不可约表示的最大维数和平均维数(按Plancherel分布)的估计。文中还给出了Richardson统计量分布的二维和三维图的极限形状的计算结果。

英文摘要:

The article presents the results of experiments in computation of statistical values related to Young diagrams, including the estimates on maximum and average (by Plancherel distribution) dimension of irreducible representation of symmetric group $S_n$. The computed limit shapes of two-dimensional and three-dimensional diagrams distributed by Richardson statistics are presented as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑