Asymptotic enumeration of generalized Latin rectangles
From MaRDI portal
Publication:1122579
DOI10.1016/0097-3165(89)90041-1zbMATH Open0676.05022OpenAlexW2040670712MaRDI QIDQ1122579FDOQ1122579
Authors: Timothy A. Green
Publication date: 1989
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(89)90041-1
Recommendations
Cites Work
Cited In (11)
- Estimating the number of Latin rectangles by the fast simulation method
- On the threshold problem for Latin boxes
- Asymptotic enumeration of Latin rectangles
- Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers
- The Asymptotic Number of Latin Rectangles
- Asymptotic enumeration of Latin rectangles
- Theory of limits of sequences of Latin squares
- A note on the asymptotic number of Latin rectangles
- Probability distributions on linear vector spaces over Galois fields and sets of permutations
- Matchings up to the permutations which form a Latin rectangle
- Large deviations in random latin squares
This page was built for publication: Asymptotic enumeration of generalized Latin rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122579)