Related papers: A q-enumeration of alternating permutations

In the present paper combinatorial identities involving q-dual sequences or polynomials with coefficients q-dual sequences are derived. Further, combinatorial identities for q-binomial coefficients(Gaussian coefficients), q-Stirling numbers…

Recently, Araci-Acikgoz-Sen derived some interesting identities on weighted q-Euler polynomials and higher-order q-Euler polynomials from the applications of umbral calculus (See [1]). In this paper, we develop the new method of q-umbral…

A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…

We revisit old conjectures of Fermat and Euler regarding representation of integers by binary quadratic form x^2+5y^2. Making use of Ramanujan's_1\psi_1 summation formula we establish a new Lambert series identity for…

A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…

Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.

We prove a combinatorial formula for the alternating descent polynomials of type A and B. Combining with Josuat-Verg\`es' combinatorial interpretation for Hoffman's derivative polynomials for tangent and secant functions, we obtain a…

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…

We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…

A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…

We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of such permutations in terms of (several) sums of determinants.…

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…

In this paper, we study the alternating Euler $T$-sums and related sums by using the method of contour integration. We establish the explicit formulas for all linear and quadratic Euler $T$-sums and related sums. Some interesting new…

A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridge's formula by using cycle…

We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the…

One purpose of this paper is to construct twisted q-Euler numbers by using p-adic invariant integral on Zp in the sense of fermionic. Finally, we consider twisted Euler q-zeta function and q-l-series which interpolate twisted q-Euler…

In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…

For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…

For certain tame abelian covers of arithmetic surfaces X/Y we obtain striking formulas, involving a quadratic form derived from intersection numbers, for the equivariant Euler characteristics of both the canonical sheaf !X/Y and also its…