Barred preferential arrangements

From MaRDI portal
Publication:396771

zbMATH Open1295.05048arXiv1206.6354MaRDI QIDQ396771FDOQ396771


Authors: Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger Edit this on Wikidata


Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1206.6354

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (11)





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)