The number of Latin rectangles

Simple item page
dc.creatorDoyle, Peter G.
dc.date2007-03-29
dc.date.accessioned2026-07-07T07:55:04Z
dc.date.available2026-07-07T07:55:04Z
dc.descriptionWe show how to generate an expression for the number of k-line Latin rectangles for any k. The computational complexity of the resulting expression, as measured by the number of additions and multiplications required to evaluate it, is on the order of n^(2^(k-1)). These expressions generalize Ryser's formula for derangements.
dc.descriptionVersion dated circa 1980; GNU FDL
dc.identifierhttps://arxiv.org/abs/math/0703896
dc.identifierhttp://arxiv.org/abs/math/0703896
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126847
dc.subjectCombinatorics
dc.titleThe number of Latin rectangles
dc.typetext

Files

Collections

arXiv