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


Riordan paths and derangements
Authors:William YC Chen  Eva YP Deng  Laura LM Yang
Institution:a Center for Combinatorics, LPMC and TJKLC, Nankai University, Tianjin 300071, PR China
b Department of Applied Mathematics, Dalian University of Technology, Dalian, Liaoning 116024, PR China
Abstract:Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and View the MathML source-avoiding derangements. We also present a combinatorial proof of a recurrence relation for the Riordan numbers in the spirit of the Foata-Zeilberger proof of a recurrence relation on the Schröder numbers.
Keywords:Riordan number  Riordan path  (321  3_method=retrieve&  _eid=1-s2  0-S0012365X07003093&  _mathId=si3  gif&  _pii=S0012365X07003093&  _issn=0012365X&  _acct=C000053510&  _version=1&  _userid=1524097&  md5=df196724e8aaaf35f8f9b111b96dc9c0')" style="cursor:pointer  View the MathML source" alt="Click to view the MathML source" title="Click to view the MathML source">View the MathML sourceels-cdn  com/content/image/1-s2  0-S0012365X07003093-si3  42)-avoiding derangement" target="_blank">gif">42)-avoiding derangement
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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