Asymptotic enumeration of Latin rectangles

DOI10.1016/0095-8956(90)90128-MMaRDI QIDQ5906245zbMATH OpenOpenAlexFDO

Authors Chris Godsil, Brendan D. McKay

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0095-8956(90)90128-m

zbMATH Keywords

enumerationLatin rectangle

Mathematics Subject Classification ID

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

Recommendations

• Asymptotic enumeration of Latin rectangles
• Asymptotic enumeration of generalized Latin rectangles
• The Asymptotic Number of Latin Rectangles
• A note on the asymptotic number of Latin rectangles
• On computing the number of Latin rectangles
• Enumerating partial Latin rectangles
• Erratum: Asymptotic enumeration of generalized latin rectangles
• The many formulae for the number of Latin rectangles
• scientific article; zbMATH DE number 205345
• Divisors of the number of Latin rectangles

Cites work

• A generalization of Riordan's formula for 3xn latin rectangles
• A vector space analog of permutations with restricted position
• An asymptotic series for the number of three-line latin rectangles
• Asymptotic enumeration of Latin rectangles
• Asymptotic evaluation of the number of latin rectangles
• Combinatorial Applications of Hermite Polynomials
• Counting Latin rectangles
• Derangements and Laguerre polynomials
• Extrapolation of asymptotic expansions by a modified Aitken \(delta^ 2- \)formula
• Hermite polynomials and a duality relation for matchings polynomials
• scientific article; zbMATH DE number 3116602 (Why is no real title available?)
• scientific article; zbMATH DE number 3878944 (Why is no real title available?)
• scientific article; zbMATH DE number 3668618 (Why is no real title available?)
• scientific article; zbMATH DE number 3765795 (Why is no real title available?)
• scientific article; zbMATH DE number 3520420 (Why is no real title available?)
• scientific article; zbMATH DE number 3600068 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3069874 (Why is no real title available?)
• Matchings and walks in graphs
• Notes on Egoritsjev's proof of the van der Waerden conjecture
• On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
• On the theory of the matching polynomial
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Spanning trees in regular graphs
• Symbolic methods in the problem of three-line Latin rectangles
• The Asymptotic Number of Latin Rectangles
• The Asymptotic Series For a Certain Class Of Permutation Problems
• The expected eigenvalue distribution of a large regular graph
• The number of matchings in random regular graphs and bipartite graphs
• The Number of Very Reduced 4 × n Latin Rectangles
• Theory of monomer-dimer systems

Cited in

(47)

• Estimating the number of Latin rectangles by the fast simulation method
• The number of matchings in random regular graphs and bipartite graphs
• Asymptotic enumeration of generalized Latin rectangles
• Enumeration of Latin arrays. I: Case \(n\leq 3\)
• A note on the asymptotic number of Latin rectangles
• The combinatorics behind number-theoretic sieves
• Most Latin squares have many subsquares
• The Holens-Đoković conjecture on permanents fails!
• Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
• Enumeration of semi-Latin squares
• Mappings of Latin squares
• A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\).
• Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
• On the number of Sudoku squares
• Exchangeable pairs, switchings, and random regular graphs
• \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy
• An update on Minc's survey of open problems involving permanents
• Sieve methods in combinatorics
• Effective scalar products of D-finite symmetric functions
• On the number of Latin squares
• On computing the number of Latin rectangles
• Counting matchings and tree-like walks in regular graphs
• On Minc's sixth Conjecture
• Orthogonal Latin Rectangles
• The cycle structure of two rows in a random Latin square
• scientific article; zbMATH DE number 3989359 (Why is no real title available?)
• scientific article; zbMATH DE number 26494 (Why is no real title available?)
• Permanents, matchings and 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
• Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers
• Counting Latin rectangles
• On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares
• The Asymptotic Number of Latin Rectangles
• Asymptotic enumeration of Latin rectangles
• Random strongly regular graphs?
• Substructures in Latin squares
• Factorisation of the complete bipartite graph into spanning semiregular factors
• Sequential importance sampling for estimating expectations over the space of perfect matchings
• Large deviations in random latin squares
• Counting deranged matchings
• Theory of limits of sequences of Latin squares
• Subsquares in random Latin squares and rectangles
• The degree-restricted random process is far from uniform
• Enumeration formulas for latin and frequency squares
• Divisors of the number of Latin rectangles
• The many formulae for the number of Latin rectangles

This page was built for publication: Asymptotic enumeration of Latin rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906245)