Further Results on the Pseudo-$L_{g}(s)$ Association Scheme with $g\geq 3$, $s\geq g+2$
Congwei Wang, Shanqi Pang, Guangzhou Chen

TL;DR
This paper improves conditions for extending partial orthogonal Latin squares using properties of specific association schemes, providing new criteria and examples for such extensions.
Contribution
It introduces two new conditions for extending partial orthogonal Latin squares by leveraging properties of $L_{g}(s)$ association schemes, refining Bruck's existing condition.
Findings
Improved bounds for extending partial Latin squares.
New criteria based on $L_{g}(s)$ association schemes.
Examples illustrating the application of the new conditions.
Abstract
It is inevitable that the association scheme with is a pseudo- association scheme. On the contrary, although treatments of the pseudo- association scheme can form one association scheme, it is not always an association scheme. Mainly because the set of cardinality , which contains two first-associates treatments of the pseudo- association scheme, is non-unique. Whether the order of a Latin square is a prime power or not, the paper proposes two new conditions in order to extend a containing . It has been known that a can be extended to a so long as Bruck's \cite{brh} condition is satisfied, Bruck's condition will be completely improved through utilizing six properties of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Coding theory and cryptography
