Abstract
Certain translation nets are shown to be equivalent to sets of mutually orthogonal Latin squares constructed by the automorphism method. Known results on fixed-point-free automorphisms are used to improve the known upper bounds on the maximum number of parallel classes in such a net. In particular, the maximum number is found exactly for such nets whose translation groups are Abelian. Applications are given both to the statistical design of experiments and to other parts of pure mathematics.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.