English
Related papers

Related papers: A q-enumeration of alternating permutations

200 papers

The finite difference equation system introduced by Christiane Poupard in the study of tangent trees is reinterpreted in the alternating permutation environment. It makes it possible to make a joint study of both tangent and secant trees…

Combinatorics · Mathematics 2013-04-10 Dominique Foata , Guo-Niu Han

The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations are unimodal via a five-term recurrence relation. We also…

Combinatorics · Mathematics 2020-11-06 Zhicong Lin , Shi-Mei Ma , David G. L. Wang , Liuquan Wang

Let R(n,k) be the number of permutations of $\{1,2,\ldots,n\}$ with k alternating runs. In this paper, we establish the relationships between R(n,k) and the central factorial numbers of even indices as well as the number of signed…

Combinatorics · Mathematics 2022-03-07 Qi Fang , Ya-Nan Feng , Shi-Mei Ma

The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…

Combinatorics · Mathematics 2017-06-13 Shinji Tanimoto

In order to study signed Eulerian numbers, we introduce permutations of a particular type, called parity-alternate permutations, because they take even and odd entries alternately. The objective of this paper is twofold. The first is to…

Combinatorics · Mathematics 2007-05-23 Shinji Tanimoto

Using Eulerian and Euler numbers, we establish congruences concerning sums involving harmonic numbers, tangent numbers and Genocchi numbers.

Number Theory · Mathematics 2021-11-22 Claire Levaillant

A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…

Combinatorics · Mathematics 2010-09-21 Giuseppe Scollo

Umbral extensions of the stirling numbers of the second kind are considered and the resulting dobinski-like various formulas including new ones are presented. These extensions naturally encompass the two well known q-extensions. The further…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

The alternating multiple harmonic sums are partial sums of the infinite series defining the Euler sums which are the alternating version of the multiple zeta value series. In this paper, we present some systematic structural results of the…

Number Theory · Mathematics 2015-11-30 Jianqiang Zhao

The $(q,r)$-Eulerian polynomials are the $(\maj-$$\exc,\fix,\exc)$ enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical…

Combinatorics · Mathematics 2013-03-12 Zhicong Lin

Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine…

Combinatorics · Mathematics 2021-11-12 Christian Gaetz , Yibo Gao

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

Number Theory · Mathematics 2015-07-22 Andrew N. W. Hone

Let $p(m)$ (respectively, $q(m)$) be the maximum number $k$ such that any tree with $m$ edges can be transformed by contracting edges (respectively, by removing vertices) into a caterpillar with $k$ edges. We derive closed-form expressions…

Combinatorics · Mathematics 2021-09-14 Rain Jiang , Kai Jiang , Minghui Jiang

The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…

Combinatorics · Mathematics 2012-04-02 Guoniu Han , Frédéric Jouhet , Jiang Zeng

In [14] Ozden-Simsek-Cangul constructed generating functions of higher-order twisted $(h,q)$-extension of Euler polynomials and numbers, by using $p$-adic q-deformed fermionic integral on $\Bbb Z_p$. By applying their generating functions,…

Number Theory · Mathematics 2007-11-01 Taekyun Kim , Leechae Jang , Cheon-Seoung Ryoo

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…

Combinatorics · Mathematics 2007-09-05 Yuliy Baryshnikov , Dan Romik

The purpose of this article is to introduce q-deformed Stirling numbers of the first and second kinds. Relations between these numbers, Riemann zeta function and q-Bernoulli numbers of higher order are given. Some relations related to the…

Number Theory · Mathematics 2018-05-16 Yilmaz Simsek

The aim of this paper is two-fold. We first prove several new interpretations of a kind of $(q,t)$-Catalan numbers along with their corresponding $\gamma$-expansions using pattern avoiding permutations. Secondly, we give a complete…

Combinatorics · Mathematics 2018-10-16 Shishuo Fu , Dazhao Tang , Bin Han , Jiang Zeng

The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…

Combinatorics · Mathematics 2024-07-17 Giulio Cerbai , Anders Claesson

We provide an involution proof of a Catalan-tangent number identity arising from the study of peak algebra that was found by Aliniaeifard and Li. In the course, we find a new combinatorial identity for the tangent numbers $T_{2n+1}$: $$…

Combinatorics · Mathematics 2025-12-01 Dongsu Kim , Zhicong Lin