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

对称群、Hecke代数和有限Chevalley群的随机分拆与渐近理论

Random partitions and asymptotic theory of symmetric groups, Hecke algebras and finite Chevalley groups

Pierre-Loïc Méliot

摘要:

在这篇论文中,我们研究了根据来自对称群$S_n$和有限Chevalley群$GL(n,F_q)$和$Sp(2n,F_q)$的表示理论的概率测度选择的随机划分的渐近性。更准确地说,我们证明了大数定律和中心极限定理的$q$-Plancherel措施的A型和B型,Schur-Weyl措施和Gelfand措施。利用RSK算法,给出了随机字的最长递增连续性的结果。我们开发了一种技术的时刻(和累积量)的随机分区,从而使用的多项式函数的意义上的Kerov和Olshanski的杨图。多项式函数的代数,或杨图的可观量是同构于部分排列的代数,在论文的最后一部分,我们试图推广这个美丽的结构。

英文摘要:

In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and $Sp(2n,F_q)$. More precisely, we prove laws of large numbers and central limit theorems for the $q$-Plancherel measures of type A and B, the Schur-Weyl measures and the Gelfand measures. Using the RSK algorithm, it also gives results on longest increasing subsequences in random words. We develop a technique of moments (and cumulants) for random partitions, thereby using the polynomial functions on Young diagrams in the sense of Kerov and Olshanski. The algebra of polynomial functions, or observables of Young diagrams is isomorphic to the algebra of partial permutations; in the last part of the thesis, we try to generalize this beautiful construction.

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

↑