No label defined (Q3972901)

[For the entire collection see Zbl 0715.00010.] A finite group \(G\) is called sequenceable if its elements \(a_ 0,a_ 1,\ldots,a_{n-1}\) can be ordered in such a way that all the partial products \[ b_ 0=a_ 0,\;b_ 1=a_ 0a_ 1,\;b_ 2=a_ 0a_ 1a_ 2,\ldots,b_{n-1}=a_ 0a_ 1a_ 2\ldots a_{n-1} \] are different. It is known that any sequenceable finite group can be used to design. The constructions for and properties of row-complete latin squares, sequenceable groups, quasi-complete latin squares, terraces and quasi- sequenceable groups are explored. A finite group \((G,\cdot)\) is called \(r\)-sequenceable if it is sequenceable and \(b_{n-1}=a_ 0a_ 1\ldots a_{n-1}=b_ 0\). When a finite group is sequenceable this guarantees that the square formed by its Cayley table is a complete latin square; an \(r\)-sequenceable finite group has a complete mapping and the latin square formed by its Cayley table has an orthogonal mate. Super \(p\)-groups are studied and their relation to \(r\)-sequencing is discussed. Next Tuscan squares and a graph decomposition problem is explored. Finally sequencing and 2-sequencing of groups is explored in depth.