首页 | 本学科首页   官方微博 | 高级检索  
     


Recurrences and formulae in an extension of the Eulerian numbers
Authors:David Magagnosc
Affiliation:

University of Santa Clara, Santa Clara, Ca, USA

Abstract:In this paper, the author develops a general formula for numbers which are extensions of the Eulerian numbers. Am tn, r) is defined to be the number of n-permutations with r rises of magnitude at least m. Intermediate steps in the derivation include a vertical recurrence relation. recurrence relations of the diagonals both as numbers and as polynomials, and recurrences and formulae strictly on the diagonals.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号