A study of a family of generating functions of Nelsen-Schmidt type and some identities on restricted barred preferential arrangements

preprint2015arXivOpen access

Abstract

A preferential arrangement of a set Xn={1,2,...,n}X_n=\{1,2,...,n\} is an ordered partition of the set XnX_n induced with a linear order. Separation of blocks of a preferential arrangement with bars result in the notation of barred preferential arrangements. Roger Nelsen and Harvey Schmidt have proposed the family of generating functions Pk(m)=ekm2−emP^k(m)=\frac{e^{km}}{2-e^m}; which for k=0k=0 and for k=2k=2 they have shown that the generating functions are exponential generating functions for the number of preferential arrangements of a set XnX_n and the number of chains in the power set of XnX_n respectively. In this study we propose combinatorial structures whose integer sequences are generated by members of the family for all values of kk in Z+\mathbb{Z}^+. To do this we use a notion of restricted barred preferential arrangements. We then propose a more general family of generating functions Pjr(m)=erm(2−em)jP^{r}_{j}(m)=\frac{e^{rm}}{(2-e^m)^j} for r,j∈Z+r,j\in\mathbb{Z^+}. We derive some new identities on restricted barred preferential arrangements and give their combinatorial proofs. We also propose conjectures on number of restricted barred preferential arrangements.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.