Automatic enumeration of generalized Ménage numbers

From MaRDI portal
Publication:402609

zbMATH Open1297.05021arXiv1401.1089MaRDI QIDQ402609FDOQ402609


Authors: Doron Zeilberger Edit this on Wikidata


Publication date: 28 August 2014

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: I describe an empirical-yet-rigorous, algorithm, based on Riordan's rook polynomials and the so-called C-finite ansatz, fully implemented in the accompanying Maple package (http://www.math.rutgers.edu/~zeilberg/tokhniot/MENAGES ), MENAGES, that reproduces in a few seconds, rigorously-proved enumeration theorems on permutations with restricted positions, previously proved by quite a few illustrious human mathematicians, and that can go far beyond any human attempts.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (3)

Uses Software





This page was built for publication: Automatic enumeration of generalized Ménage numbers

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