An integer lattice arising in the model theory of wreath products

  • Gregory Cherlin
  • Gary Martin
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 12)


While attempting to find methods of some generality for computing a model-theoretic invariant of finite structures (the arity, as defined in §1), we found it useful to compute a number of examples by making use of a related integer lattice L r, depending on a single parameter r. These computations have led to a plausible formula for this invariant which is at least a correct lower bound, and is exact in the few cases we are able to check directly. (For more details see §3.)


Equivalence Relation Permutation Group Incidence Matrix Wreath Product Integer Lattice 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Be]
    Bender, E. [1974], Asymptotic methods in enumeration. SIAM Review 16, 485–515.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [CM]
    Cherlin, G. and G. Martin. Arities of wreath products. In preparation.Google Scholar
  3. [KL]
    Knight, J. and A.H. Lachlan [1987], Shrinking, Stretching, and Codes for Homogeneous Structures. In Classification Theory (Chicago, 1985), ed. J. Baldwin, Lecture Notes in Mathematics 1292, Springer-Verlag, New York.Google Scholar
  4. [L]
    Lovasz, L. [1989], Geometry of numbers and integer programming. In Mathematical Programming, eds. M. Iri and K. Tanabe, KTK Scientific Publishers, Tokyo.Google Scholar

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • Gregory Cherlin
    • 1
  • Gary Martin
    • 2
  1. 1.Rutgers UniversityNew BrunswickUSA
  2. 2.University of Massachusetts at DartmouthNorth DarmouthUSA

Personalised recommendations