Cycles on a multiset with only even-odd drops

DOI10.1016/J.DISC.2021.112683MaRDI QIDQ2666580zbMATH OpenOpenAlexWikidataFDO

Authors Zhicong Lin, Sherry H. F. Yan

Publication date 23 November 2021

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

D-cycleseven-odd dropsGenocchi numbersLaguerre histories

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumerative combinatorics (05A99) Other combinatorial number theory (11B75)

Abstract: For a finite subset $A$ of $mathbb{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 $g_n$. 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 $g_n$ invented by Dumont and the cycles on $[2n]$ with only even-odd drops.

Review text

For a finite subset \(A\) of \(\mathbb{Z}_{>0}\), \textit{A. Lazar} and \textit{M. L. Wachs} [``The homogenized linial arrangement and Genocchi numbers, Preprint, \url{arXiv:1910.07651}] conjectured that the number of cycles on \(A\) with only even-odd drops is equal to the number of D-cycles on \(A\). Based on \textit{D. Dumont}'s interpretation of Genocchi numbers \(g_n\) [Duke Math. J. 41, 305--318 (1974; Zbl 0297.05004)], the objective of this paper is to present two different bijective proofs of a conjecture due to Lazar and Wachs [loc.cit.] which asserts that cycles on \([2n]\) with only even-odd drops are also counted by \(g_n\). Actually, the authors introduce cycles on a multiset with only even-odd drops and prove bijectively a multiset generalization of another related conjecture of Lazar and Wachs [loc.cit.]. Moreover, an Inclusion-Exclusion approach to Dumont's result [loc. cit.] was proposed. A bijection between a class of permutations of length \(2n-1\) known to be counted by \(g_n\) invented by Dumont and the cycles on \([2n]\) with only even-odd drops was also constructed.

Recommendations

• Parity considerations for drops in cycles on \(\{1,2,\dots,n\}\)
• On a problem raised by P. J. Cameron
• A note on the total number of cycles of even and odd permutations
• scientific article; zbMATH DE number 812050
• The number of cycles with a given descent set
• Exact and asymptotic enumeration of cyclic permutations according to descent set
• Description and generation of permutations containing cycles
• Adjacent \(q\)-cycles in permutations
• On the disarrangements with k cycles.
• Permutations

Cites work

• Combinatorial proofs of some properties of tangent and Genocchi numbers
• Enumerations of permutations by circular descent sets
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• Interpretations combinatoires des nombres de Genocchi
• On the homogenized linial arrangement: intersection lattice and Genocchi numbers
• Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
• The symmetric and unimodal expansion of Eulerian polynomials via continued fractions

Cited in

(4)

• Parity considerations for drops in cycles on \(\{1,2,\dots,n\}\)
• Counting inversion sequences by parity successions and runs
• Cycles of even-odd drop permutations and continued fractions of Genocchi numbers
• Permanent identities, combinatorial sequences, and permutation statistics

This page was built for publication: Cycles on a multiset with only even-odd drops

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