欧拉数三角形的边界
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。