Automatic enumeration of generalized Ménage numbers
From MaRDI portal
(Redirected from Publication:402609)
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.
Recommendations
- Enumeration schemes and, more importantly, their automatic generation
- Enumeration and automatic sequences
- scientific article; zbMATH DE number 1474907
- An automorphic generalization of the Stirling numbers
- scientific article; zbMATH DE number 1180496
- Overview of some general results in combinatorial enumeration
- scientific article; zbMATH DE number 6985848
- Enumeration of \(M\)-partitions
- Combinatorics of generalized Motzkin numbers
- scientific article; zbMATH DE number 2186886
Cited in
(3)
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)