Counting Latin rectangles

DOI10.1090/S0273-0979-1987-15465-6zbMath0617.05015OpenAlexW2008046623MaRDI QIDQ4726263

Ira M. Gessel

Publication date: 1987

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0273-0979-1987-15465-6

zbMATH Keywords

enumerationLatin rectangles

Mathematics Subject Classification ID

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

Related Items (10)

On the completability of incomplete orthogonal Latin rectangles ⋮ On computing the number of Latin rectangles ⋮ Mappings of Latin squares ⋮ Automatic counting of generalized Latin rectangles and trapezoids ⋮ TC operations and Latin bricks ⋮ Symmetric functions and P-recursiveness ⋮ A holonomic systems approach to special functions identities ⋮ Enumeration formulas for latin and frequency squares ⋮ Divisors of the number of Latin rectangles ⋮ Asymptotic enumeration of Latin rectangles

Cites Work

• The diagonal of a D-finite power series is D-finite
• Differentiably finite power series
• On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
• Sister Celine's technique and its generalizations
• Counting 3 by n Latin Rectangles
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Three-Line Latin Rectangles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting Latin rectangles