- 353 Downloads
The starting point for all our considerations is the following: We are given two sets, usually denoted by N and R, and a mapping f: N → R satisfying certain conditions. The triple (N, R, f) is called a morphism. Our program is to arrange mappings into classes, and then to count and order the resulting classes of mappings.
KeywordsBoolean Algebra Permutation Group Congruence Relation Congruence Class Dominance Order
Unable to display preview. Download preview PDF.
- 1.Ryser, H. J.: Combinatorial Mathematics. Carus Math. Monographs Nr. 14, New York: Math. Ass. Amer. (1963).Google Scholar
- 1.Riordan, J.: An Introduction to Combinatorial Mathematics. New York, London, Sydney: John Wiley and Sons (1958).Google Scholar
- 2.Riordan, J.: Combinatorial Identities. New York, London, Sidney: John Wiley and Sons (1968).Google Scholar
- 2.Berge, C.: Principles of Combinatorics. New York, London: Academic Press (1971).Google Scholar