Noticing that some recent variations of descent polynomials are special cases of Carlitz and Scoville's four-variable polynomials, which enumerate permutations by the parity of descent and ascent positions, we prove a $q$-analogue of Carlitz-Scoville's generating function by counting the inversion number and a type B analogue by enumerating the signed permutations with respect to the parity of desecnt and ascent positions. As a by-product of our formulas, we obtain a $q$-analogue of Chebikin's formula for alternating descent polynomials, an alternative proof of Sun's gamma-positivity of her bivariate Eulerian polynomials and a type B analogue, the latter refines Petersen's gamma-positivity of the type B Eulerian polynomials.
The web permutations were introduced by Hwang, Jang and Oh to interpret the entries of the transition matrix between the Specht and $\mathrm{SL}_2$-web bases of the irreducible $§_{2n}$-representation indexed by $(n,n)$. They conjectured that certain classes of web permutations are enumerated by the Seidel triangle. Using generating functions, Xu and Zeng showed that enumerating web permutations by the number of drops, fixed points and cycles gives rise to the normalized $γ$-coefficients of the $(α,t)$-Eulerian polynomials. They posed the problems to prove their result combinatorially and to find an interpretation of the normalized $γ$-coefficients in terms of cycle-up-down permutations. In this work, we prove the enumerative conjecture of Hwang-Jang-Oh and answer the two open problems proposed by Xu and Zeng.