arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0709.0897math.RTmath.COmath.GR
收藏

对称群Character的度和钩数

Symmetric Group Character Degrees and Hook Numbers

David A. Craven

摘要:

本文证明了对任意两个自然数k和j,以及对所有充分大的对称群Sym(n),存在k个Sym(n)的j个不可约特征标的不交集,使得每个集合由相同次数的特征标组成,不同的集合具有不同的次数。特别是,这解决了莫雷托最近提出的一个猜想。这里采用的方法是基于对称群的不可约特征和它们对应的分区之间的对偶性。因此,该文件是组合的性质。

英文摘要:

In this article we prove the following result: that for any two natural numbers k and j, and for all sufficiently large symmetric groups Sym(n), there are k disjoint sets of j irreducible characters of Sym(n), such that each set consists of characters with the same degree, and distinct sets have different degrees. In particular, this resolves a conjecture most recently made by Moretó. The methods employed here are based upon the duality between irreducible characters of the symmetric groups and the partitions to which they correspond. Consequently, the paper is combinatorial in nature.

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

↑