The boundary of the Eulerian number triangle

Simple item page
dc.creatorGnedin, Alexander
dc.creatorOlshanski, Grigori
dc.date2006-02-27
dc.date.accessioned2026-07-07T07:37:03Z
dc.date.available2026-07-07T07:37:03Z
dc.descriptionThe 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/math/0602610
dc.identifierhttp://arxiv.org/abs/math/0602610
dc.identifierMoscow Mathematical Journal 6 (2006), no 3, 461-475
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120645
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60J50; 60C05
dc.titleThe boundary of the Eulerian number triangle
dc.typetext

Files

Collections

arXiv