On the representation of substitutions as products of a transposition and a full cycle

被引：0
|
作者：
Zubov A.Y. [1 ]
机构：
[1] Moscow State University, Moscow
来源：
Journal of Mathematical Sciences | 2010年 / 166卷 / 6期
关键词：
Symmetric Group; Bottom Line; Inductive Assumption; Full Cycle; Multiple Occurrence;
D O I：
10.1007/s10958-010-9887-z
中图分类号：
学科分类号：
摘要：
A method of solving equations of the form gy1 ·h·gy2·h·...· gy1·h·gyl+1 = σ in the symmetric group Sn is proposed, where h is a transposition, g is a full cycle, and σ ∈ Sn. The method is based on building all sets of generalized inversions of the bottom line of the substitution σ by means of a system of Boolean equations associated with σ. An example of solving an equation in a group S6 is given. © 2010 Springer Science+Business Media, Inc.
引用
收藏
页码：710 / 724
页数：14
相关论文
共 50 条
12345