Automatic counting of generalized Latin rectangles and trapezoids

From MaRDI portal
Publication:6097992

DOI10.54550/ECA2022V2S1R8zbMATH Open1512.05051arXiv2108.11285OpenAlexW3210986736MaRDI QIDQ6097992FDOQ6097992


Authors: George Spahn, Doron Zeilberger Edit this on Wikidata


Publication date: 9 June 2023

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

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.


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




Recommendations




Cites Work


Cited In (1)





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)