An alternative and simpler proof of the following result is given: Every r x s generalized partial latin rectangle Q on A = (1, 2, , k} can be extended to an n x n generalized latin square on A if and only if n 2 r + s -min{N(i) 1 i E A}, where N(i) denotes the number of times that the symbol i appe
โฆ LIBER โฆ
Asymptotic enumeration of generalized latin rectangles
โ Scribed by Timothy A Green
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 428 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A result on generalized latin rectangles
โ
Chai-Ling Deng; Chong-Keang Lim
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 396 KB
Asymptotic evaluation of the number of L
โ
Charles M Stein
๐
Article
๐
1978
๐
Elsevier Science
๐
English
โ 440 KB
A Note on the Asymptotic Number of Latin
โ
I. Skau
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 75 KB
The enumeration problem of Latin rectangles is formulated in terms of permanents, and two 'hard' inequalities of permanents are applied in a squeezing manner, both giving and suggesting asymptotic formulas.
A Matroid Generalization of a Result on
โ
Glenn G. Chappell
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 194 KB
Let A be an m\_n matrix in which the entries of each row are all distinct. A. A. Drisko (1998, J. Combin. Theory Ser. A 84, 181 195) showed that if m 2n&1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices with entries in the
A generalization of Riordan's formula fo
โ
W.O.J. Moser
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 165 KB
Enumeration of generalized graphs
โ
N.G de Bruijn; D.A Klarner
๐
Article
๐
1969
๐
Elsevier Science
โ 546 KB