The existence of circular Florentine arrays (Q1570085)

A \(k\times n\) circular Florentine array is an array of \(n\) distinct symbols in \(k\) circular rows with the property that (1) each row contains every symbol exactly once, and (2) for any pair of distinct symbols \((a,b)\) and for any integer \(m\) from \(1\) to \(n-1\) there is at most one row in which \(b\) occurs \(m\) steps to the right of \(a\). For each positive integer \(n\geq 2\), define \(F_c(n)\) to be the maximum number such that an \(F_c(n)\times n\) circular Florentine array exists. Using sets of mutually orthogonal latin squares with an additional property, the author is able to reduce the gap between upper and lower bounds on \(F_c(n)\) for infinitely many values of \(n\).