加载中…
When one inserts a number of identical bars in between blocks of an ordered set partition, they get a barred preferential arrangement. In this study we define a new generalization of barred preferential arrangements, by considering barred preferential arrangements with no fixed blocks, and ones where the first r elements of a set are singletons. We derive several combinatorial identities. Combinatorially these numbers are a kind of generalized barred preferential arrangements. We also provide some asymptotic results for these numbers.

生成讲解博客的中文版本

生成AI智能校验的中文版本