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


Restricted words by adjacencies
Authors:Don Rawlings
Affiliation:

Mathematics Department, California Polytechnic State University, San Luis Obispo, CA, 93407, USA

Abstract:A recurrence, a determinant formula, and generating functions are presented for enumerating words with restricted letters by adjacencies. The main theorem leads to refinements (with up to two additional parameters) of known results on compositions, polyominoes, and permutations. Among the examples considered are (1) the introduction of the ascent variation on compositions, (2) the enumeration of directed vertically convex polyominoes by upper descents, area, perimeter, relative height, and column number, (3) a tri-variate extension of MacMahon's determinant formula for permutations with prescribed descent set, and (4) a combinatorial setting for an entire sequence of bibasic Bessel functions.
Keywords:Free monoid   Adjacencies   Compositions   Directed vertically convex polyominoes   Ascent variation   Simon Newcomb problem
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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