
This paper investigates a natural linear family of cyclic Latin squares parametrized by the Fibonacci sequence over Z_N. We provide explicit greatest common divisor (gcd) criteria for Latinity, the existence of affine transversals, and mutual orthogonality. By leveraging classical Fibonacci identities (d'Ocagne and Cassini) and the Chinese Remainder Theorem, we show that consecutive arrays in this family naturally form orthogonal pairs. Furthermore, we derive an exact multiplicative counting formula for the total number of affine transversals, demonstrating explicitly that no such transversals exist for even moduli.
Affine Transversals, Orthogonality, and Enumeration in Fibonacci-Linear Cyclic Latin Squares
Affine Transversals, Orthogonality, and Enumeration in Fibonacci-Linear Cyclic Latin Squares
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
