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

Bibliographic Details
Main Authors: George Spahn, Doron Zeilberger
Format: Article
Language:English
Published: University of Haifa, Department of Mathematics 2023-02-01
Series:Enumerative Combinatorics and Applications
Subjects:
Online Access:https://ecajournal.haifa.ac.il/Volume2023/ECA2023_S2A10.pdf
_version_ 1797904297835364352
author George Spahn
Doron Zeilberger
author_facet George Spahn
Doron Zeilberger
author_sort George Spahn
collection DOAJ
first_indexed 2024-04-10T09:46:38Z
format Article
id doaj.art-9e60fdbf5c1e44f7bb208d4e602b9c9f
institution Directory Open Access Journal
issn 2710-2335
language English
last_indexed 2024-04-10T09:46:38Z
publishDate 2023-02-01
publisher University of Haifa, Department of Mathematics
record_format Article
series Enumerative Combinatorics and Applications
spelling doaj.art-9e60fdbf5c1e44f7bb208d4e602b9c9f2023-02-17T04:56:35ZengUniversity of Haifa, Department of MathematicsEnumerative Combinatorics and Applications2710-23352023-02-0132Article #S2R1010.54550/ECA2023V3S2R10Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)George Spahn0Doron Zeilberger1Rutgers University (New Brunswick)Rutgers University (New Brunswick)https://ecajournal.haifa.ac.il/Volume2023/ECA2023_S2A10.pdfinclusion-exclusionpermutationssymbolic-computation
spellingShingle George Spahn
Doron Zeilberger
Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)
Enumerative Combinatorics and Applications
inclusion-exclusion
permutations
symbolic-computation
title Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)
title_full Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)
title_fullStr Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)
title_full_unstemmed Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)
title_short Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)
title_sort counting permutations where the difference between entries located r places apart can never be s for any given positive integers r and s
topic inclusion-exclusion
permutations
symbolic-computation
url https://ecajournal.haifa.ac.il/Volume2023/ECA2023_S2A10.pdf
work_keys_str_mv AT georgespahn countingpermutationswherethedifferencebetweenentrieslocatedrplacesapartcanneverbesforanygivenpositiveintegersrands
AT doronzeilberger countingpermutationswherethedifferencebetweenentrieslocatedrplacesapartcanneverbesforanygivenpositiveintegersrands