Cycles on a multiset with only even-odd drops
Abstract
For a finite subset A of Z>0, Lazar and Wachs (2019) conjectured that the number of cycles on A with only even-odd drops is equal to the number of D-cycles on A. In this note, we introduce cycles on a multiset with only even-odd drops and prove bijectively a multiset version of their conjecture. As a consequence, the number of cycles on [2n] with only even-odd drops equals the Genocchi number gn. With Laguerre histories as an intermediate structure, we also construct a bijection between a class of permutations of length 2n-1 known to be counted by gn invented by Dumont and the cycles on [2n] with only even-odd drops.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.