Chains in Power Sets
In this useful note the authors discuss methods for obtaining the coefficients \(a_{n,k}\) of chains of length \(k\) in the \(n\)-cube \(P(X_ n)\) considered as a finite poset in the usual way as a product of \(n\) 2- chains which yields the power-set order. They use the problem as an illustration of the application of classical combinatorial counting and other techniques and they investigate the interrelationships between the formulas so obtained. Their most interesting results are obtained using several exponential generating functions permitting them to explore patterns similar to those obtained for Bell numbers for examples. An ``overall generating function \(P(x,t)=e^{tx}/(2-e^ x)\) is obtained concerning which the authors note that \(t=0\) and \(t=2\) yield known structures on \(P(X_ n)\), while other values still require interpretation.
- Counting lattice chains and Delannoy paths in higher dimensions
- A combinatorial analysis of higher order generalised geometric polynomials: a generalisation of barred preferential arrangements
- A note on lattice chains and Delannoy numbers
- scientific article; zbMATH DE number 3916274 (Why is no real title available?)
- scientific article; zbMATH DE number 4002098 (Why is no real title available?)
- On the number of antichains and antichain covers of labeled sets
- Generalized barred preferential arrangements
- A second type of higher order generalized geometric polynomials and higher order generalized Euler polynomials
- A study of a family of generating functions of Nelsen-Schmidt type and some identities on restricted barred preferential arrangements
- Chains, multichains and Möbius numbers
- Combinatorics of counting finite fuzzy subsets
This page was built for publication: Chains in Power Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982675)