๐”– Bobbio Scriptorium
โœฆ   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

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

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

Enumeration of generalized graphs
โœ N.G de Bruijn; D.A Klarner ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science โš– 546 KB