Asymptotic evaluation of the number of latin rectangles

DOI10.1016/0097-3165(78)90029-8zbMath0429.05022OpenAlexW2088012620MaRDI QIDQ1137588

Charles M. Stein

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90029-8

zbMATH Keywords

random permutationslatin rectanglerandom rectangular array

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices, Asymptotic enumeration of generalized Latin rectangles, Sequential importance sampling for estimating expectations over the space of perfect matchings, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, On the number of Latin rectangles and chromatic polynomial of L(K//(r,s)), Asymptotic enumeration of Latin rectangles, Exchangeable pairs, switchings, and random regular graphs, Asymptotic enumeration of Latin rectangles, Random permutations on a set with a binary relation, Combinatorial analysis. (Matrix problems, choice theory)

Cites Work

• Unnamed Item
• Poisson approximation for dependent trials
• The Asymptotic Number of Latin Rectangles