Abstract: A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with respect to one or more bars. We present various combinatorial identities for r_{m,l}, the number of barred preferential arrangements of l elements with m bars, using both algebraic and combinatorial arguments. Our main result is an expression for r_{m,l} as a linear combination of the r_k (= r_{0,k}, the number of unbarred preferential arrangements of k elements) for l <= k<=l+m. We also study those arrangements in which the sections, into which the blocks are segregated by the bars, must be nonempty. We conclude with an expression of r_l as an infinite series that is both convergent and asymptotic.
Recommendations
Cites work
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3008649 (Why is no real title available?)
- A course of modern analysis
- On the Partition Function p (n )
- On the expansion of the partition functions in a series
- Preferential Arrangements
- The hypercube of resistors, asymptotic expansions, and preferential arrangements
Cited in
(11)- A unified generalization of Touchard and Fubini polynomial extensions
- On higher order generalized geometric polynomials with shifted parameters
- On the combinatorics of symmetrized poly-Bernoulli numbers
- Higher order generalized geometric polynomials
- Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
- Recurrences and congruences for higher-order geometric polynomials and related numbers
- 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
- Generalized barred preferential arrangements
- On the generalization of the Lambert \(W\) function
- A combinatorial analysis of higher order generalised geometric polynomials: a generalisation of barred preferential arrangements
This page was built for publication: Barred preferential arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396771)