Combinatorics

Norman D. Thomson
Additional contact information
Norman D. Thomson: IBM (United kingdom) Laboratories Ltd.

Chapter Chapter 9 in APL Programs for the Mathematics Classroom, 1989, pp 135-144 from Springer

Abstract: Abstract Combinatorial algorithms deal with the arrangement of objects in cells. The number of such algorithms is legion due to such considerations as : are the objects ordered within cells; are the cells themselves ordered; are empty cells allowed; how many kinds of distinguishable objects are present. The whole range of such algorithms would fill a book in its own right — a few of the most basic ones are given here covering permutations (with derangements as a subset), combinations, selections with repetition, compositions and partitions.

Date: 1989
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3668-9_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461236689

DOI: 10.1007/978-1-4612-3668-9_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().