Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares (Q1182863)

The decomposition of the complete digraph on \(n\) vertices into \(n\) directed Hamiltonian paths is related to the problem of constructing Row Complete Latin squares or Roman squares. A Latin square of order \(n\) is an \(n\times n\) square such that (1) each row is a permutation of \(\{1,2,\dots,n\}\) and (2) so is each column. A Roman square is a Latin square, in addition, satisfying that (3) all the adjacent ordered pairs of symbols in the rows are distinct. A square satisfying only (1) and (3) is called Tuscan square. In every Tuscan square, the \(n\) rows are \(n\) Hamiltonian paths which form the above decomposition of the complete digraph. In this paper, the author presented a few new constructions for Tuscan squares of prime order.