학술

Transitive Sets of Mutually Orthogonal Latin Squares

arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.

Abstract

Write $n=\prod_{i=1}^u p_i^{a_i}$ for the prime factorization of $n$.

We prove that a net of order $n$ admitting a point-transitive group of automorphisms preserving each parallel class has at most $\min_i(p_i^{a_i}+1)$ parallel classes.

This extends Jungnickel's sharp bound for translation nets.

Equivalently, the maximum number of jointly cell-transitive mutually orthogonal Latin squares of order $n$ is $\min_i(p_i^{a_i}-1)$.

An explicit Latin square of order nine answers affirmatively Krotov and Potapov's question about the existence of an isotopically transitive, non-topolinear Latin square.

관련 뉴스