欧拉分拆定理及其推广和一个新的限制形式.docx

Chapter1. Introduction results.SylvesterandBessenrodtnaturalyobtainathree-variablerefinementofEulers Theorem.Ittelsusthatthenumberofdistinctpartitionsofnwithlargestpartkwhose alternatingsum islsuchthatexactly-m,chainsoccurineachpartitionisequaltothe numberofpartitionsofnintoIoddpartswhereexactlyrndistinctoddpartsappear and2k+1equalstothelargestpart plustwicethenumberofparts. Glaisheralsoobtainaone-variablerefinementthroughNumberTheory:thenumber ofpartitionsofnintodistinctpartswithkoddpartsisequaltothenumberofpartitions ofnwithoddpartswherethereareexactlykpartsrepeatedoddtimes.Itiseasyto checkthatSylvestersbijectionisofnousehere. CorrespondingtotheresultofSylvesterandBessenrodt,wecastdoubtonwhether thereexistsathree-variablerefinementofEulerspartitiontheorem includingGlaishers refinementornot.Fortunately,weindfthatthereindeedexistssucharefinementwhen weworkoverthepaper[151.Abijectionisconstructedtoprovethetheoremthatthe numberofdistinctpartitionsofnwithloddpartswhoselternatingasumisrnequals thenumberofpartitionsofnintoexactlyrnoddpartsinwhichlpartsrepeatoddtimes. Chapter2 TheElementaryTheoryof Partitions 2.1 BasicConceptsofPartitions Definition1ApartitionAofapositiveintegernisainitefnonincreasingsequencefo positiveintegers少;，A2，二.，h少suchthat艺几1a:=。Thena;， caledthepartsfo thepartitionA. UsualyweshalwriteJASfortheweightofthepartitionA:JAI=EA,.Equivalently, wewriteAFnif。=JAI.ThenumberofthepositivepartsofthepartitionAiscaled thelengthofthepartitionA,denoted勿l(A).Sometimesitisusefultouseanotation thatmakesexplicitthenumberoftimesthataparticularintegeroccursasapart.Thus ifA=(A,A2, ，A,)1-。，wesometimeswrite A=(1i，2，3，二，) exactly7n;oftheajareequaltoi.Notethat艺。，7n,i二二 Definition2ForapartitionA=(a,,，，.，A,),wedefinetheconjugatepartitionX= (X,A},2 ，)k)ofAbysetingAitobethenumberofpartsofAthat。、greaterthanor equaltoi. Clearly,wehavet(A)=从，t,=t(X).Moreover,theexplicit ofa,is ^‘=(1\`-a=，2X2-A3?) (2.1) Definition3Thepartitionfunctionp(n)isthenumberofpartitionsofn.Furthermore letp(S,