Advertisement

Mappings

  • Martin Aigner
Chapter
  • 353 Downloads
Part of the Grundlehren der mathematischen Wissenschaften book series (GL, volume 234)

Abstract

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: NR 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.

Keywords

Boolean Algebra Permutation Group Congruence Relation Congruence Class Dominance Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 1.
    Ryser, H. J.: Combinatorial Mathematics. Carus Math. Monographs Nr. 14, New York: Math. Ass. Amer. (1963).Google Scholar
  2. 1.
    Riordan, J.: An Introduction to Combinatorial Mathematics. New York, London, Sydney: John Wiley and Sons (1958).Google Scholar
  3. 2.
    Riordan, J.: Combinatorial Identities. New York, London, Sidney: John Wiley and Sons (1968).Google Scholar
  4. 1.
    Hall, M., Jr.: The Theory of Groups. New York: MacMillan (1959).zbMATHGoogle Scholar
  5. 2.
    Berge, C.: Principles of Combinatorics. New York, London: Academic Press (1971).Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1979

Authors and Affiliations

  • Martin Aigner
    • 1
  1. 1.II. Institut für MathematikFreie Universität BerlinBerlin 33Federal Republic of Germany

Personalised recommendations