Abstract
The Eulerian numbers count permutations according to the number of descents. The two-sided Eulerian numbers count permutations according to number of descents and the number of descents in the inverse permutation. Here we derive some results for Eulerian and two-sided Eulerian numbers using an elementary "balls-in-boxes" approach. We also discuss an open conjecture of Ira Gessel about the two-sided Eulerian numbers.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.