Permanent identities, combinatorial sequences, and permutation statistics.

In this paper, we confirm six conjectures on the exact values of some permanents, relating them to the Genocchi numbers of the first and second kinds as well as the Euler numbers. For example, we prove that per [ ⌊ 2 j − k n ⌋ ] 1 ≤ j , k ≤ n = 2 (2 n + 1 − 1) B n + 1 , where B 0 , B 1 , B 2 , ... are the Bernoulli numbers. We also show that per [ sgn (cos ⁡ π i + j n + 1) ] 1 ≤ i , j ≤ n = { − ∑ k = 0 m ( m k ) E 2 k + 1 if n = 2 m + 1 , ∑ k = 0 m ( m k ) E 2 k if n = 2 m , where sgn (x) is the sign function, and E 0 , E 1 , E 2 , ... are the Euler (zigzag) numbers. In the course of linking the evaluation of these permanents to the aforementioned combinatorial sequences, the classical permutation statistic – the excedance number, together with several kinds of its variants, plays a central role. Our approach features recurrence relations, bijections, as well as certain elementary operations on matrices that preserve their permanents. Moreover, our proof of the second permanent identity leads to a proof of Bala's conjectural continued fraction formula, and an unexpected permutation interpretation for the γ -coefficients of the 2-Eulerian polynomials. [ABSTRACT FROM AUTHOR]