From the concept of set,we summarize the methods and skills of the enumeration of discrete objects in terms of multiset,totally ordered set,and partial ordered set,a fundamental principle of a count,etc.Then the application of generating function,enumeration of lattice paths,and Polya's enumeration theorem in discrete object counting is illustrated by examples.Finally,the power of Maple,a computer-aided software,in solving discrete object counting problems quickly and efficiently is introduced through a brief program of solving isomers in chemistry.
discrete objectenumerationgenerating functionenumeration of lattice pathsPolya's enumeration theorem
万方数据
维普
