Journal of Combinatorial Theory, Series A, Volume 55

Volume 55, Number 1, September 1990

• R. A. Bailey, Dieter Jungnickel:
  Translation nets and fixed-point-free group automorphisms. 1-13
  
• Soichi Okada:
  Wreath products by the symmetric groups and product posets of Young's lattices. 14-32
  
• Zbigniew Lonc:
  Solution of a delta-system decomposition problem. 33-48
  
• Shalom Eliahou, Michel Kervaire, Bahman Saffari:
  A new restriction on the lengths of golay complementary sequences. 49-59
  
• Asia Ivic Weiss:
  Some infinite families of finite incidence-polytopes. 60-73
  
• Nicolas Percsy:
  On the geometry of Zara graphs. 74-79
  
• Hélène Barcelo, Nantel Bergeron:
  The Orlik-Solomon algebra on the partition lattice and the free Lie algebra. 80-92
  
• Hélène Barcelo:
  On the action of the symmetric group on the Free Lie Algebra and the partition lattice. 93-129
  
• Aiden A. Bruen:
  Nuclei of sets of q + 1 points in PG(2, q) and blocking sets of Redei type. 130-132
  
• Christiane Lefevre-Percsy:
  Infinite (Af, Af^*)-geometries. 133-139
  
• C. Ohn:
  Notes on dimensional closure spaces. 140-142
  
• James F. Lynch:
  Taxonomic classes of sets. 143-152
  
• Steven Skiena:
  Counting k-projections of a point set. 153-160
  

Volume 55, Number 2, November 1990

• Bruce E. Sagan, Richard P. Stanley:
  Robinson-schensted algorithms for skew tableaux. 161-193
  
• François Bergeron, Yeong-Nan Yeh:
  The factoriality of the ring of S-species. 194-203
  
• Dale M. Mesner, Prabir Bhattacharya:
  Association schemes on triples and a ternary algebra. 204-234
  
• Frank Bernhardt, Peter Landrock, Olaf Manz:
  The extended golay codes considered as ideals. 235-246
  
• Joel H. Spencer:
  Counting extensions. 247-255
  
• G. Hanssens, Hendrik Van Maldeghem:
  Hjelmslev-quadrangles of level n. 256-291
  
• Boris Pittel, H. Rubin:
  How many random questions are necessary to identify n distinct objects? 292-312
  
• Alexander Pott:
  An affine analogue of Wilbrink's theorem. 313-315
  
• Zoltán Füredi:
  The maximum number of unit distances in a convex n-gon. 316-320