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

因子幂上的单模

Simple modules over factorpowers

Volodymyr Mazorchuk

摘要:

本文研究有限群$G$作用于有限集$M$的因子幂$\fp(G,M)$的复表示.这包括有限幺半群$\FP$,它可以被看作是所有二元关系半群中对称群$S_n$的一种“平衡”推广。我们描述了$\fp(G,M)$的所有不可约表示,并将它们与某些逆半群的不可约表示联系起来。特别地,$\FP$的不可约表示与对偶对称逆幺半群的极大可因式分解子幺半群的不可约表示有关。我们还表明,在后一种情况下,不可约表示导致一个有趣的组合问题的表示论的$S_n$,特别是,与福克斯猜想。最后,我们证明了所有的简单$\fp(G,M)$ -模是酉化的,简单$\fp(G,M)$ -模的张量积是完全可约的。

英文摘要:

In this paper we study complex representations of the factorpower $\fp(G,M)$ of a finite group $G$ acting on a finite set $M$. This includes the finite monoid $\FP$, which can be seen as a kind of a ``balanced'' generalization of the symmetric group $S_n$ inside the semigroup of all binary relations. We describe all irreducible representations of $\fp(G,M)$ and relate them to irreducible representations of certain inverse semigroups. In particular, irreducible representations of $\FP$ are related to irreducible representations of the maximal factorizable submonoid of the dual symmetric inverse monoid. We also show that in the latter cases irreducible representations lead to an interesting combinatorial problem in the representation theory of $S_n$, which, in particular, is related to Foulkes' conjecture. Finally, we show that all simple $\fp(G,M)$-modules are unitarizable and that tensor products of simple $\fp(G,M)$-modules are completely reducible.

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

↑