Langford sequences: Some connections with complete and additive permutations (Q914673): Difference between revisions

A Langford (s,m,n)-sequence is a family \({\mathcal L}\) of sets \(P_ j=\{a_ 1(j),a_ 2(j),...,a_ s(j)\}\), the positions of j, \(m\leq j\leq n\), with the properties \[ (1)\quad a_{i+1}(j)=a_ i(j)+j+1,\quad 1\leq i<s\quad and \] \[ \quad (2)\quad \cup^{n}_{j=m}P_ j=\{k:\;1\leq k\leq s(n+1- m)\}. \] A Langford sequence of separated type is a Langford (2,m,3m)- sequence such that \[ (3)\quad 1\leq a_ 1(j)\leq 2m+1;\quad 2m+2\leq a_ 2(j)\leq 4m+2. \] In this paper relations between such sequences and special permutations are considered and results of some computer studies are given.