Estimating the number of Latin rectangles by the fast simulation method

DOI10.1007/s10559-009-9079-3zbMath1184.05017OpenAlexW2011164354MaRDI QIDQ1040349

N. Yu. Kuznetsov

Publication date: 24 November 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9079-3

zbMATH Keywords

sample varianceLatin squaretransversalrelative errorunbiased estimateLatin rectanglefast simulation method

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

A congruence connecting Latin rectangles and partial orthomorphisms ⋮ Sequential importance sampling for estimating expectations over the space of perfect matchings ⋮ Additive triples of bijections, or the toroidal semiqueens problem ⋮ Divisors of the number of Latin rectangles ⋮ On the number of transversals in Cayley tables of cyclic groups

Cites Work

• The complexity of completing partial Latin squares
• The number of transversals in a Latin square
• Estimating the number of good permutations by a modified fast simulation method
• Upper bound on the number of complete maps
• Estimation of the number of ``good permutations with applications to cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Estimating the number of Latin rectangles by the fast simulation method