The boundary of the Eulerian number triangle
  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. 
Alexander Gnedin and Grigori Olshanski