Enumerative Combinatorics: Contents
Enumerative Combinatorics: Contents
复制标题
DOI：
10.1017/cbo9781139058520
复制
发表时间：
2011-12
期刊：
影响因子：
--
通讯作者：
R. Stanley
中科院分区：
文献类型：
--
作者：
R. Stanley
The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite setsSiwhereiranges over some index setI(such as the nonnegative integers ℕ), and we wish to count the number ƒ(i) of elements of eachSi“simultaneously.” Immediate philosophical difficulties arise. What does it mean to “count” the number of elements ofSi? There is no definitive answer to this question. Only through experience does one develop an idea of what is meant by a “determination” of a counting function ƒ(i).
