文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Bijective proofs of parity theorems for partition statistics
侵权投诉

Bijective proofs of parity theorems for partition statistics

We give bijective proofs of parity theorems for four related statistics on partitions of finite sets. A consequence of our results is a combinatorial proof of a congruence between Stirling numbers and binomial coefficients.

Bijective proofs of parity theorems for partition statistics

Journal of Integer Sequences, Vol. 8 (2005),Article 05.1.5

BijectiveProofsofParityTheoremsforPartitionStatistics

MarkShattuck

DepartmentofMathematics

UniversityofTennessee

Knoxville,TN37996-1300

USAshattuck@math.utk.edu

Abstract

Wegivebijectiveproofsofparitytheoremsforfourrelatedstatisticsonpartitions

of nitesets.Aconsequenceofourresultsisacombinatorialproofofacongruence

betweenStirlingnumbersandbinomialcoe cients.

1Introduction

Thenotationalconventionsofthispaperareasfollows:N:={0,1,2,...},P:={1,2,...},

[0]:= ,and[n]:={1,...,n}forn∈P.Emptysumstakethevalue0andemptyproducts nthevalue1,with00:=1.Thebinomialcoe cientkisequaltozeroifkisanegativeintegerorif0 n<k.

LetΠ(n,k)denotethesetofallpartitionsof[n]withkblocksandΠ(n)thesetofallpartitionsof[n].Associatetoeachπ∈Π(n,k)theorderedpartition(E1,...,Ek)of[n]comprisingthesameblocksasπ,arrangedinincreasingorderoftheirsmallestelements,andde nestatisticsw ,w ,w ,andwby

k w (π):=(i 1)(|Ei| 1),(1.1)

(1.2)

(1.3)w (π):=w (π):=i=1k i=1i=1k i(|Ei| 1)=w (π)+n k, ki|Ei|=w (π)+n+,2

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email