English
Related papers

Related papers: The signed Eulerian numbers on involutions

200 papers

The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…

Combinatorics · Mathematics 2007-05-23 Shinji Tanimoto

In this paper, we study Eulerian polynomials for permutations and signed permutations of the multiset $\{1,1,2,2,\ldots,n,n\}$. Properties of these polynomials, including recurrence relations and unimodality are discussed. In particular, we…

Combinatorics · Mathematics 2021-03-09 Shi-Mei Ma , Jun Ma , Yeong-Nan Yeh

A symmetry of $(t,q)$-Eulerian numbers of type $B$ is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type $B$. This involution also proves a symmetry of the…

Combinatorics · Mathematics 2015-12-18 Soojin Cho , Kyoungsuk Park

The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…

Combinatorics · Mathematics 2008-06-03 Eli Bagno , David Garber , Toufik Mansour , Robert Shwartz

It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…

Combinatorics · Mathematics 2009-09-18 Bruce Sagan , John Shareshian , Michelle L. Wachs

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Combinatorics · Mathematics 2023-06-22 David Dong

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

The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…

Combinatorics · Mathematics 2025-11-25 Matjaž Konvalinka , T. Kyle Petersen

In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

The Eulerian distribution on the involutions of the symmetric group is unimodal, as shown by Guo and Zeng. In this paper we prove that the Eulerian distribution on the involutions of the hyperoctahedral group, when viewed as a colored…

Combinatorics · Mathematics 2023-09-25 Vassilis-Dionyssis P. Moustakas

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

A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on $\mathfrak{S}_n$ was given by D\'{e}sarm\'{e}nien and Foata in 1992, and a refined version, called signed Euler-Mahonian identity, together with a…

Combinatorics · Mathematics 2020-07-28 Sen-Peng Eu , Zhicong Lin , Yuan-Hsun Lo

The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…

Number Theory · Mathematics 2025-01-15 Bruce E. Sagan

In this paper, we derive some interesting symmetric properties for the geenralized Euler numbers and polynomials.

Number Theory · Mathematics 2009-07-29 T. Kim

In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…

Combinatorics · Mathematics 2007-05-23 John Shareshian , Michelle L. Wachs

We combinatorially prove that the number $R(n,k)$ of permutations of length $n$ having $k$ runs is a log-concave sequence in $k$, for all $n$. We also give a new combinatorial proof for the log-concavity of the Eulerian numbers.

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Richard Ehrenborg

The Euler-Maclaurin formula which relates a discrete sum with an integral, is generalised to the setting of Riemann-Stieltjes sums and integrals on stochastic processes whose paths are a.s. rectifiable, namely, continuous and with bounded…

Probability · Mathematics 2025-05-06 Carlo Bellingeri , Peter K. Friz , Sylvie Paycha

We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…

Combinatorics · Mathematics 2018-05-07 Arthur Nunge

In this paper, we first introduce the number of signed permutations with exactly $k$ inversions, which is denoted by $i_B(n,k)$ and called \textit{Mahonian numbers of type $B$}. Then we provide a recurrence relation for the Mahonian numbers…

Combinatorics · Mathematics 2024-04-09 Hasan Arslan

We prove a new signed elementary symmetric function expansion of the chromatic quasisymmetric function of any natural unit interval graph. We then use a sign-reversing involution to prove a new combinatorial formula for K-chains, which are…

Combinatorics · Mathematics 2024-05-09 Foster Tom
‹ Prev 1 2 3 10 Next ›