



























Problem 8.1 in Astaiza et. al. asks about the relationship between the cycle decomposition of a permutation $σ$ and that of its symmetric tensor power $σ^{\odot k}$. In this paper, we investigate this question and give formulas for computing the number of fixed points and, in the case of a permutation containing at most one cycle of length greater than one, the number of $s$-cycles.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。