Barred Preferential Arrangements

被引:0
作者
Ahlbach, Connor [1 ]
Usatine, Jeremy [1 ]
Pippenger, Nocholas [1 ]
机构
[1] Harvey Mudd Coll, Dept Math, Claremont, CA 91711 USA
关键词
ordered set partitions; enumeration; asymptotics; PARTITION-FUNCTION;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 enumerate 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.
引用
收藏
页数:18
相关论文
共 10 条
[1]  
CAYLEY A, 1859, PHILOS MAG, V18, P374
[2]  
Graham R.L., 1989, Concrete Mathematics
[3]   PREFERENTIAL ARRANGEMENTS [J].
GROSS, OA .
AMERICAN MATHEMATICAL MONTHLY, 1962, 69 (01) :4-&
[4]  
Hardy GH, 1918, P LOND MATH SOC, V17, P75
[5]  
Pippenger N., 2010, Math. Mag., V83, P331, DOI [DOI 10.4169/002557010X529752, DOI 10.4169/002557010x529752]
[6]  
Rademacher H, 1937, P LOND MATH SOC, V43, P241
[7]   On the expansion of the partition function in a series [J].
Rademacher, H .
ANNALS OF MATHEMATICS, 1943, 44 :416-422
[8]  
Sloane NJA, The online encyclopedia of integer sequences (OEIS)
[9]  
Touchard J., 1933, Annales de la Societ Scientifique de Bruxelles, V53, P21
[10]  
WHITTAKER ET, COURSE MODERN ANAL