Automatic counting of generalized Latin rectangles and trapezoids

DOI10.54550/ECA2022V2S1R8MaRDI QIDQ6097992zbMATH OpenOpenAlexFDO

Authors George Spahn, Doron Zeilberger

Publication date 9 June 2023

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.11285

zbMATH Keywords

Latin squareLatin rectangleinclusion-exclusionsymbolic dynamic programmingweighted enumeration of tilings

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Abstract: In this case study in ``fully automated enumeration, we illustrate how to take full advantage of symbolic computation by developing (what we call) `symbolic-dynamical-programming' algorithms for computing many terms of `hard to compute sequences', namely the number of Latin trapezoids, generalized derangements, and generalized three-rowed Latin rectangles. At the end we also sketch the proof of a generalization of Ira Gessel's 1987 theorem that says that for any number of rows, k, the number of Latin rectangles with k rows and n columns is P-recursive in n. Our algorithms are fully implemented in Maple, and generated quite a few terms of such sequences.

Recommendations

• Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers
• On computing the number of Latin rectangles
• Enumerating partial Latin rectangles
• Symmetric functions and P-recursiveness
• scientific article; zbMATH DE number 3989359

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3989359 (Why is no real title available?)
• A holonomic systems approach to special functions identities
• Automatic enumeration of generalized Ménage numbers
• Counting 3 by n Latin Rectangles
• Counting Latin rectangles
• Solution of the “Problème des ménages”

Cited in

(1)

• Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers

This page was built for publication: Automatic counting of generalized Latin rectangles and trapezoids

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