solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看306次
Permutation groups arising from pattern involvement. (arXiv:1605.05571v2 [math.CO] UPDATED)
来源于:arXiv
For an arbitrary finite permutation group $G$, subgroup of the symmetric
group $S_\ell$, we determine the permutations involving only members of $G$ as
$\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$.
The set of all $n$-permutations with this property constitutes again a
permutation group. We consequently refine and strengthen the classification of
sets of permutations closed under pattern involvement and composition that is
due to Atkinson and Beals. 查看全文>>