This paper is a tutorial devoted to describing how to use some of the tools that APL can provide in the field of combinatorics. Emphasis will be on enumerative combinatorics. The field of combinatorics has undergone tremendous change since the advent of the electronic computer. In the past it has been generally sufficient to answer questions of the sort: “In how many ways is it possible to ... ?”.Now, in many cases, it is possible to generate each of the ways and to study them further (either manually or through the computer). For example, many books in combinatorics describe how to compute the number of ways a dollar can be changed, now it is a simple task to write a function to enumerate all of the ways. APL is well suited as a tool to aid in the solution of problems in combinatorics. This paper is a tutorial devoted to describing how to use some of the tools that APL provides.
Unfortunately, ACM prohibits us from displaying non-influential references for this paper.
To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=810818.