Enumerative combinatorics

C. Charalambides
{"title":"Enumerative combinatorics","authors":"C. Charalambides","doi":"10.1145/1466390.1466395","DOIUrl":null,"url":null,"abstract":"good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations. The proofs of some theorems are continued after the statements and proofs of needed lemmas with no helpful demarcations (“Continuation of proof of Theorem . . . ”). Finally, at least one lemma (3.34) has a corollary with no theorem or proposition in sight; the status of Lemma 3.36 is also unclear. Lemma 1.16 on page 12 giving a closed formula for Stirling numbers of the second kind is important enough to figure in the proof of capstone Theorem 3.71 (Schlömilch’s formula) on page 114. This nonstandard approach to chapter organization may impede some readers’ comprehending the structure of the author’s highly purposeful discussion. Review of 3 Enumerative Combinatorics Author of Book: Charalambos A. Charalambides Publisher: Chapman & Hall/CRC ISBN L-58488-290-5, Hard Cover, 609 pages","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"109","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1466390.1466395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 109

Abstract

good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations. The proofs of some theorems are continued after the statements and proofs of needed lemmas with no helpful demarcations (“Continuation of proof of Theorem . . . ”). Finally, at least one lemma (3.34) has a corollary with no theorem or proposition in sight; the status of Lemma 3.36 is also unclear. Lemma 1.16 on page 12 giving a closed formula for Stirling numbers of the second kind is important enough to figure in the proof of capstone Theorem 3.71 (Schlömilch’s formula) on page 114. This nonstandard approach to chapter organization may impede some readers’ comprehending the structure of the author’s highly purposeful discussion. Review of 3 Enumerative Combinatorics Author of Book: Charalambos A. Charalambides Publisher: Chapman & Hall/CRC ISBN L-58488-290-5, Hard Cover, 609 pages
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
列举的组合
好,不支持这个;“示例”的标签用相当小的字体,后面跟着一个“证明”,并且示例的主体是非斜体的,与其他带有演示的语句完全不同。一些定理的证明是在必要的引理的陈述和证明之后继续进行的,没有有用的划分(“定理证明的延续……”)。”)。最后,至少有一个引理(3.34)有一个没有定理或命题的推论;引理3.36的状态也不清楚。第12页的引理1.16给出了第二类斯特林数的封闭公式,这对于第114页的顶点定理3.71 (Schlömilch的公式)的证明是非常重要的。这种非标准的章节组织方法可能会阻碍一些读者理解作者高度目的性讨论的结构。本书作者:Charalambos A. Charalambides出版商:Chapman & Hall/CRC ISBN L-58488-290-5,精装,609页
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Technical Report Column Open Problems Column Distributed Computing Column 87 Recent Advances in Multi-Pass Graph Streaming Lower Bounds The Book Review Column Recent Advances in Multi-Pass Graph Streaming Lower Bounds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1