Enumeration formulas for generalized q-Euler numbers
classification
🧮 math.CO
keywords
formulaeulernumberenumerationfindanothercasescombinatorial
read the original abstract
We find an enumeration formula for a $(t,q)$-Euler number which is a generalization of the $q$-Euler number introduced by Han, Randrianarivony, and Zeng. We also give a combinatorial expression for the $(t,q)$-Euler number and find another formula when $t=\pm q^r$ for any integer $r$. Special cases of our latter formula include the formula of the $q$-Euler number recently found by Josuat-Verg\`es and Touchard-Riordan's formula.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.