A342997 Maximum number of diagonal transversals in a cyclic diagonal Latin square of order 2n+1.

1, 0, 5, 27, 0, 4665, 131106, 0, 204995269, 11254190082

Offset: 0

Author

Eduard I. Vatutin, Apr 02 2021

Keywords

• nonn
• more
• hard

Comments

A cyclic Latin square is a Latin square in which row i is obtained by cyclically shifting row i-1 by d places (see A338562, A123565 and A341585).

Cyclic diagonal Latin squares do not exist for even n.

All cyclic diagonal Latin squares are diagonal Latin squares, so a((n-1)/2) <= A287648(n).

All diagonal transversals are transversals, so a(n) <= A006717(n).

A342998 <= a(n).

Examples

			For n=2 one of the best cyclic diagonal Latin squares of order 5
  0 1 2 3 4
  2 3 4 0 1
  4 0 1 2 3
  1 2 3 4 0
  3 4 0 1 2
has a(2)=5 diagonal transversals:
  0 . . . .   . 1 . . .   . . 2 . .   . . . 3 .   . . . . 4
  . . 4 . .   . . . 0 .   . . . . 1   2 . . . .   . 3 . . .
  . . . . 3   4 . . . .   . 0 . . .   . . 1 . .   . . . 2 .
  . 2 . . .   . . 3 . .   . . . 4 .   . . . . 0   1 . . . .
  . . . 1 .   . . . . 2   3 . . . .   . 4 . . .   . . 0 . .
		

Links

• Eduard I. Vatutin, Enumerating the diagonal transversals for cyclic diagonal Latin squares of orders 1-19 (in Russian).
• Eduard I. Vatutin, Proving list (best known examples).
• Index entries for sequences related to Latin squares and rectangles.

Crossrefs

Cf. A006717, A123565, A287648, A338562, A341585, A342998.