Name
Abstract | ||
|---|---|---|
We use a greedy probabilistic method to prove that, for every ε 0, every m × 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1017/S0963548307008590 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
n latin rectangle,orthogonal mate,greedy probabilistic method,n symbol,latin rectangle,mn cell,orthogonal latin rectangle,probabilistic method,mathematics | Discrete mathematics,Orthogonal array,Combinatorics,Probabilistic method,Latin rectangle,Mathematics | Journal |
Volume | Issue | ISSN |
17 | 4 | 0963-5483 |
Citations | PageRank | References |
4 | 0.62 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roland HÄggkvist | 1 | 4 | 0.62 |
| Anders Johansson | 2 | 4 | 0.62 |