Orthogonal latin rectangles
| dc.creator | Häggkvist, Roland | |
| dc.creator | Johansson, Anders | |
| dc.date | 2004-09-21 | |
| dc.date | 2007-02-28 | |
| dc.date.accessioned | 2026-07-07T07:49:06Z | |
| dc.date.available | 2026-07-07T07:49:06Z | |
| dc.description | We use a greedy probabilistic method to prove that for every $ε> 0$, every $m\times n$ Latin rectangle on $n$ symbols has an orthogonal mate, where $m=(1-ε)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. | |
| dc.description | Accepted for publication in CPC | |
| dc.identifier | https://arxiv.org/abs/math/0409398 | |
| dc.identifier | http://arxiv.org/abs/math/0409398 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/124724 | |
| dc.subject | Combinatorics | |
| dc.subject | 05B15 | |
| dc.title | Orthogonal latin rectangles | |
| dc.type | text |