Search

The Euler number $E_n$ (resp. Entringer number $E_{n,k}$) enumerates the alternating (down-up) permutations of $\{1,\dots,n\}$ (resp. starting with $k$). The Springer number $S_n$ (resp. Arnold number $S_{n,k}$) enumerates the type $B$ alternating permutations (resp. starting with $k$). In this paper, using bijections we first derive the counterparts in {\em Andr\'e permutations} and {\em Simsun permutations} for the Entringer numbers $(E_{n,k})$, and then the counterparts in {\em signed Andr\'e permutations} and {\em type $B$ increasing 1-2 trees} for the Arnold numbers $(S_{n,k})$., Comment: 21 pages, 3 figures, 6 tables

In this paper, we establish the following two congruences: \begin{gather*} \sum_{k=0}^{(p+1)/2}(3k-1)\frac{\left(-\frac{1}{2}\right)_k^2\left(\frac{1}{2}\right)_k4^k}{k!^3}\equiv p-6p^3\left(\frac{-1}{p}\right)+2p^3\left(\frac{-1}{p}\right)E_{p-3}\pmod{p^4},\\ \sum_{k=0}^{p-1}(3k-1)\frac{\left(-\frac{1}{2}\right)_k^2\left(\frac{1}{2}\right)_k4^k}{k!^3}\equiv p-2p^3\pmod{p^4}, \end{gather*} where $p>3$ is a prime, $E_{p-3}$ is the $(p-3)$-th Euler number and $\left(-\right)$ is the Legendre symbol. The first congruence modulo $p^3$ was conjectured by Guo and Schlosser recently., 11 pages

It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group by considering the largest descent class, and computed the value in each case of the classification. We consider here another generalization of Euler numbers for finite Coxeter groups, building on Stanley's result about the number of orbits of maximal chains of set partitions. We present a method to compute these integers and obtain the value in each case of the classification., Comment: The first version has been split, only the first part remains here and the rest will appear with the title "Refined enumeration of noncrossing chains and hook formulas"