Transpositional sequences and multigraphs

arXiv1904.09694MaRDI QIDQ6317536FDOQ6317536

Donald Silberger, Alissa Ellis Yazinski, Raymond R. III Fletcher

Publication date: 21 April 2019

Abstract: When $$ is a sequence of transpositions on the finite set $n:=0,1,ldots,n-1$, then $$ denotes the compositional product of the sequence. Our paper treats the set $$ of all $$, where $$ is a sequence obtained by rearranging the terms of $$. The paper characterizes the set of all transpositional sequences $$ for which $$ is the subset of a single congugacy class in the symmetric group $mSym(n)$; we call such $$ {it conjugacy invariant}. At the opposite extreme, the paper studies conditions under which $$ is {it permutationally complete}, which is to say, those $$ for which either $$ or $$.

Mathematics Subject Classification ID

Symmetric groups (20B30) Permutation groups (20B99)

This page was built for publication: Transpositional sequences and multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6317536)