Orthogonal Latin Rectangles

From MaRDI portal



Abstract: We use a greedy probabilistic method to prove that for every epsilon>0, every mimesn Latin rectangle on n symbols has an orthogonal mate, where m=(1−epsilon)n. That is, we show the existence of a second Latin rectangle such that no pair of the mn cells receives the same pair of symbols in the two rectangles.












This page was built for publication: Orthogonal Latin Rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527541)