Advertisement

Recurrence relations for the number of labeled structures on a finite set

  • Chr. Blatter
  • E. Specker
Section I: Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 171)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Chr. Blatter et E. Specker, Le nombre de structures finies d'une théorie à caractère fini, Sciences Mathématiques, Fonds National de la Recherche Scientifique, Bruxelles 1981, 41–44Google Scholar
  2. [2]
    Chr. Blatter and E. Specker, Modular periodicity of combinatorial sequences, Abstracts Am. Math. Soc. 4 (1983), 313Google Scholar
  3. [3]
    A. Ehrenfeucht, Application of games to some problem of mathematical logic, Bull. Acad. Pol., Cl. III, 5 (1957), 35–37Google Scholar
  4. [4]
    R. Fraïssé, Sur quelques classifications des systèmes de relations, Publ. Sci. Univ. Alger Ser. A, 1 (1954), 35–182Google Scholar
  5. [5]
    I.M. Gessel, Combinatorial proofs of congruences, preprintGoogle Scholar
  6. [6]
    T.S. Motzkin, Sorting numbers for cylinders and other classification numbers, Proc. of Symposia in pure mathematics 19 (1971), 167–176Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Chr. Blatter
    • 1
  • E. Specker
    • 1
  1. 1.Mathematisches SeminarEidgenössische Technische Hochschule Zürich ETH-ZentrumZürich

Personalised recommendations