The automorphism group of the subsequence poset B_m,n
Let \(a=a_1a_2\dots a_n\) be a word over an alphabet. We say that a word \(b=b_1b_2\dots b_m\) is a subword (or a subsequence) of \(a\) whenever there exists an increasing sequence \(1\leq j_1<j_2<\dots<j_m\leq n\) with \(b_i=a_{j_i}\) for all \(i=1,2,\dots,m\). Then we will write \(b\leq a\). Let \(\mathbf u_{m,n}=a_1a_2\dots a_n\) be a word of length \(n\) such that \(a_i\equiv i\bmod m\) for all \(i=1,2,\dots,n\). Let \(\mathbf B_{m,n}\) denote the poset formed by all subwords of \(\mathbf u_{m,n}\) with the partial order \(\leq\). The automorphism group of \(\mathbf B_{m,n}\) is isomorphic to (i) the symmetric group of an \(n\)-element set when \(1\leq n\leq m\); (ii) the cartesian product of the symmetric group of a \((2m-n)\)-element set and the symmetric group of a \(2\)-element set when \(m+1\leq n<2m\); (iii) the symmetric group of a \(2\)-element set when \(2m\leq n\).
- On posets of \(m\)-ary words
- Automorphisms of subword-posets
- scientific article; zbMATH DE number 4174959 (Why is no real title available?)
- scientific article; zbMATH DE number 4191751 (Why is no real title available?)
- A finite word poset
- Computing orbits of the automorphism group of the subsequence poset \(B_{m,n}\) for \(n\geq 2m\)
- Computing orbits of the automorphism group of the subsequence poset \(B_{ m, n }\)
- Partial multiple mixing on subsequences may distinguish between automorphisms \(T\) and \(T^{-1}\)
This page was built for publication: The automorphism group of the subsequence poset \(B_{m,n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1568673)
