找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Combinatorial Theory; Martin Aigner Book 1979 Springer-Verlag New York Inc. 1979 Combinatorics.Counting.Finite.Lattice.Permutation.algebra

[復制鏈接]
查看: 55922|回復: 45
樓主
發(fā)表于 2025-3-21 17:15:54 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Combinatorial Theory
編輯Martin Aigner
視頻videohttp://file.papertrans.cn/231/230022/230022.mp4
叢書名稱Grundlehren der mathematischen Wissenschaften
圖書封面Titlebook: Combinatorial Theory;  Martin Aigner Book 1979 Springer-Verlag New York Inc. 1979 Combinatorics.Counting.Finite.Lattice.Permutation.algebra
描述It is now generally recognized that the field of combinatorics has, over the past years, evolved into a fully-fledged branch of discrete mathematics whose potential with respect to computers and the natural sciences is only beginning to be realized. Still, two points seem to bother most authors: The apparent difficulty in defining the scope of combinatorics and the fact that combinatorics seems to consist of a vast variety of more or less unrelated methods and results. As to the scope of the field, there appears to be a growing consensus that combinatorics should be divided into three large parts: (a) Enumeration, including generating functions, inversion, and calculus of finite differences; (b) Order Theory, including finite posets and lattices, matroids, and existence results such as Hall‘s and Ramsey‘s; (c) Configurations, including designs, permutation groups, and coding theory. The present book covers most aspects of parts (a) and (b), but none of (c). The reasons for excluding (c) were twofold. First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such
出版日期Book 1979
關鍵詞Combinatorics; Counting; Finite; Lattice; Permutation; algebra; calculus; discrete mathematics; duality; func
版次1
doihttps://doi.org/10.1007/978-1-4615-6666-3
isbn_softcover978-1-4615-6668-7
isbn_ebook978-1-4615-6666-3Series ISSN 0072-7830 Series E-ISSN 2196-9701
issn_series 0072-7830
copyrightSpringer-Verlag New York Inc. 1979
The information of publication is updating

書目名稱Combinatorial Theory影響因子(影響力)




書目名稱Combinatorial Theory影響因子(影響力)學科排名




書目名稱Combinatorial Theory網絡公開度




書目名稱Combinatorial Theory網絡公開度學科排名




書目名稱Combinatorial Theory被引頻次




書目名稱Combinatorial Theory被引頻次學科排名




書目名稱Combinatorial Theory年度引用




書目名稱Combinatorial Theory年度引用學科排名




書目名稱Combinatorial Theory讀者反饋




書目名稱Combinatorial Theory讀者反饋學科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 23:53:49 | 只看該作者
Book 1979present book covers most aspects of parts (a) and (b), but none of (c). The reasons for excluding (c) were twofold. First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such
板凳
發(fā)表于 2025-3-22 01:32:26 | 只看該作者
地板
發(fā)表于 2025-3-22 08:17:09 | 只看該作者
5#
發(fā)表于 2025-3-22 10:46:23 | 只看該作者
Matroids: Introduction,en brought successfully into the realm of matroid theory. Indeed, it is this exchange of ideas from various fields which is one of the most gratifying aspects of matroid theory and also one measure of its success.
6#
發(fā)表于 2025-3-22 15:42:07 | 只看該作者
7#
發(fā)表于 2025-3-22 18:55:40 | 只看該作者
Book 1979hose potential with respect to computers and the natural sciences is only beginning to be realized. Still, two points seem to bother most authors: The apparent difficulty in defining the scope of combinatorics and the fact that combinatorics seems to consist of a vast variety of more or less unrelat
8#
發(fā)表于 2025-3-22 22:52:46 | 只看該作者
9#
發(fā)表于 2025-3-23 02:40:34 | 只看該作者
Vitalii V. Aksenov,Katerina A. Beklemyshevag general counting principles rather than on supplying a large set of recursion and inversion formulae for well-known coefficients such as the binomial coefficients or various partition numbers. For a good collection of the latter the reader is referred to Riordan [1, 2] or to Knuth [1, vol. 1].
10#
發(fā)表于 2025-3-23 07:38:40 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-8 22:01
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
福泉市| 蓬莱市| 包头市| 礼泉县| 衡南县| 卫辉市| 都昌县| 安庆市| 和林格尔县| 嘉荫县| 睢宁县| 南和县| 温泉县| 芜湖县| 井研县| 阳西县| 揭西县| 红安县| 营口市| 紫阳县| 宁南县| 瑞昌市| 融水| 尉氏县| 朝阳区| 东兰县| 乌海市| 南丹县| 大理市| 洛阳市| 黄平县| 全椒县| 田东县| 龙里县| 萨嘎县| 炉霍县| 千阳县| 丰都县| 察隅县| 翁源县| 巴南区|