|
This article is cited in 15 scientific papers (total in 15 papers)
The boundary of the Eulerian number triangle
A. V. Gnedina, G. I. Olshanskiib a Utrecht University
b Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random permutations and Markov chains we show that the boundary is discrete and explicitly identify its elements.
Key words and phrases:
Eulerian numbers, extreme boundary, descents.
Received: March 6, 2006
Citation:
A. V. Gnedin, G. I. Olshanskii, “The boundary of the Eulerian number triangle”, Mosc. Math. J., 6:3 (2006), 461–475
Linking options:
https://www.mathnet.ru/eng/mmj256 https://www.mathnet.ru/eng/mmj/v6/i3/p461
|
|