Barred preferential arrangements

zbMATH Open1295.05048MaRDI QIDQ396771FDOQ396771

Authors: Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger 

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

• Generalized barred preferential arrangements
• Forbidding undesirable agreements
• Coalition preclusion contracts and moderate policies
• scientific article; zbMATH DE number 3965197
• Barrier style contracts under Lévy processes once again
• A barrier option of American type
• Restriction by noncontraction

zbMATH Keywords

set partitions

Mathematics Subject Classification ID

Partitions of sets (05A18) Asymptotic enumeration (05A16) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• Title not available (Why is that?)
• Preferential Arrangements
• Title not available (Why is that?)
• Title not available (Why is that?)
• A course of modern analysis
• On the Partition Function p (n )
• On the expansion of the partition functions in a series
• The hypercube of resistors, asymptotic expansions, and preferential arrangements

Cited In (11)

• On higher order generalized geometric polynomials with shifted parameters
• On the generalization of the Lambert \(W\) function
• A second type of higher order generalized geometric polynomials and higher order generalized Euler polynomials
• Generalized barred preferential arrangements
• Recurrences and congruences for higher-order geometric polynomials and related numbers
• A combinatorial analysis of higher order generalised geometric polynomials: a generalisation of barred preferential arrangements
• Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
• On the combinatorics of symmetrized poly-Bernoulli numbers
• Higher order generalized geometric polynomials
• A study of a family of generating functions of Nelsen-Schmidt type and some identities on restricted barred preferential arrangements
• A unified generalization of Touchard and Fubini polynomial extensions

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)