On the Foundations of Combinatorial Theory

On the Foundations of Combinatorial Theory

ID:40722531

大小:1.76 MB

页数:29页

时间:2019-08-06

On the Foundations of Combinatorial Theory_第1页
On the Foundations of Combinatorial Theory_第2页
On the Foundations of Combinatorial Theory_第3页
On the Foundations of Combinatorial Theory_第4页
On the Foundations of Combinatorial Theory_第5页
资源描述:

《On the Foundations of Combinatorial Theory》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、Z.Wahrseheinlichkeitstheorie2,340--368(1964)OntheFoundationsofCombinatorialTheoryI.TheoryofMiibiusFunctionsByGIAN-CAI~LOROT~Contents1.Introduction...............................3402.Preliminaries...............................3423.Theincidencealgebra...........................3444.Mai

2、nresults...............................3475.Applications................................3496.TheEulercharacteristic..........................3527.Geometriclattices.............................3568.Representations.............................3609.Application:thecoloringofgraphs........

3、.............36110.Application:flowsinnetworks.......................3641.IntroductionOneofthemostusefulprinciplesofenumerationindiscreteprobabilityandcombinatorialtheoryisthecelebratedprincipleo/inclusion-exclusion(cf.F~LL]~R*,FR~C~IET,RIORDA~,RYS~).Whenskillfullyapplied,thisprincipl

4、ehasyieldedthesolutiontomanyacombinatorialproblem.ItsmathematicalfoundationswerethoroughlyinvestigatednotlongagoinamonographbyF~CH~T,anditmightatfirstappearthat,aftersuchexhaustivework,littleelsecouldbesaidonthesubject.Onefrequentlynotices,however,awidegapbetweenthebarestatementofthep

5、rincipleandtheskillrequiredinrecognizingthatitappliestoaparticularcombinatorialproblem.Ithasoftentakenthecombinedeffortsofmanyacombinatorialanalystoverlongperiodstorecognizeaninclusion-exclusionpattern.Forexample,forthem4nageproblemittookfifty-fiveyears,sinceCAYL~'sattempts,beforeJACQ

6、UESTOUCHA~Din1934couldrecognizeapattern,andthencereadilyobtainthesolutionasanexplicitbinomialformula.Thesituationbecomesbewilderinginproblemsrequiringanenumerationofanyofthenumerouscollectionsofcombinatorialobjectswhicharenowadayscomingtothefore.Thecountingoftrees,graphs,partiallyorde

7、redsets,complexes,finitesetsonwhichgroupsact,nottomentionmoredifficultproblemsrelatingtopermu-tationswithrestrictedposition,suchasLatinsquaresandthecoloringofmaps,seemtoliebeyondpresent-daymethodsofenumeration.ThelackofasystematicThisworkwasbegunundercontract5TSF-GP-149,continuedunder

8、contr

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。