The boundary of the Eulerian number triangle

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
21 pages

Keywords

Probability, Combinatorics, 60J50; 60C05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/120645

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0602610
 http://arxiv.org/abs/math/0602610
 Moscow Mathematical Journal 6 (2006), no 3, 461-475

Collections

arXiv