An operator on permutations and its application to Eulerian numbers

DOI10.1006/eujc.2000.0497zbMath0986.05005OpenAlexW2028678664MaRDI QIDQ5942878

Shinji Tanimoto

Publication date: 6 June 2002

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2000.0497

zbMATH Keywords

congruence relationdescentsEulerian numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05)

Related Items (4)

Parity alternating permutations and signed Eulerian numbers ⋮ Combinatorics of the group of parity alternating permutations ⋮ Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets ⋮ A study of Eulerian numbers by means of an operator on permutations

Cites Work

• On the Eulerian numbers \(\displaystyle{ M_ n = \max{}_{1{\leq{}}k{\leq{}}n}A(n,k)}\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An operator on permutations and its application to Eulerian numbers