Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)

DOI10.54550/ECA2023V3S2R10MaRDI QIDQ6659947zbMATH OpenFDO

Authors George Spahn, Doron Zeilberger

Publication date 9 January 2025

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

zbMATH Keywords

permutationsinclusion-exclusionsymbolic-computation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Recommendations

• scientific article; zbMATH DE number 3941545
• scientific article; zbMATH DE number 2077075
• Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes
• Enumeration of restricted permutation triples
• Approaches for enumerating permutations with a prescribed number of occurrences of patterns

Cites work

• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1975686 (Why is no real title available?)
• Automatic enumeration of generalized Ménage numbers
• Levels in bargraphs
• Permutations (question 4750, de G. Métrod).
• The Probability that Neighbors Remain Neighbors After Random Rearrangements
• The dinner table problem: the rectangular case
• The method of creative telescoping
• The method of differentiating under the integral sign
• What is an Answer?

This page was built for publication: Counting permutations where the difference between entries located \(r\) places apart can never be \(s\) (for any given positive integers \(r\) and \(s\))

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