Proof of several conjectures relating permanents to combinatorial sequences
From MaRDI portal
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Group actions on combinatorial structures (05E18) Continued fractions (11A55) Bernoulli and Euler numbers and polynomials (11B68) Determinants, permanents, traces, other special matrix functions (15A15)
Abstract: In this paper, we prove six conjectures on the evaluations of permanents, relating them to Genocchi numbers of the first and second kinds as well as (binomial) Euler numbers. For example, we prove that mathrm{per}left[leftlfloorfrac{2j-k}{n}
ight
floor
ight]_{1le j,kle n}=2(2^{n+1}-1)B_{n+1}, where is the floor function and are the Bernoulli numbers. This was previously conjectured by the third author. Various permutation statistics are at the heart of our approaches.
This page was built for publication: Proof of several conjectures relating permanents to combinatorial sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6378413)