Current research on algebraic combinatorics

This paper gives an account of recent activity in the field of algebraic combinatorics and thus updates our book, Algebraic Combinatorics I (Benjamin/Cummings, 1984).

[1]  Aeryung Moon.  The graphs G(n, k) of the Johnson Schemes are unique for n geq 20 , 1984, J. Comb. Theory, Ser. B.

[2]  Joe Hemmeter.  Distance-Regular Graphs and Halved Graphs , 1986, Eur. J. Comb..

[3]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[4]  John Shawe-Taylor,et al.  CUBIC DISTANCE-REGULAR GRAPHS , 1986 .

[5]  Dennis Stanton,et al.  Association schemes and quadratic transformations for orthogonal polynomials , 1986, Graphs Comb..

[6]  R. Weiss.  On Distance‐Transitive Graphs , 1985 .

[7]  Arnold Neumaier,et al.  Classification of graphs by regularity , 1981, J. Comb. Theory, Ser. B.

[8]  Richard M. Weiss,et al.  Distance-transitive graphs and generalized polygons , 1985 .

[9]  Ronald L. Graham,et al.  The Radon transform on $Z^k_2$. , 1985 .

[10]  Tatsuro Ito,et al.  On distance-regular graphs with fixed valency , 1987, Graphs Comb..

[11]  Arnold Neumaier,et al.  Characterization of a class of distance regular graphs , 1985 .

[12]  Chris D. Godsil,et al.  Distance-regularised graphs are distance-regular or distance-biregular , 1987, J. Comb. Theory, Ser. B.

[13]  Akihiro Munemasa,et al.  An analogue oft-Designs in the association schemes of alternating bilinear forms , 1986, Graphs Comb..

[14]  Tatsuro Ito,et al.  On distance-regular graphs with fixed valency, III , 1987 .

[15]  Tayuan Huang.  A Characterization of the Association Schemes of Bilinear Forms , 1987, Eur. J. Comb..

[16]  Kazumasa Nomura.  Ont-homogeneous permutation sets , 1985 .

[17]  Thomas Hawkins,et al.  New light on Frobenius' creation of the theory of group characters , 1974 .

[18]  Arnold Neumaier,et al.  Distance Matrices and n-dimensional Designs , 1981, Eur. J. Comb..

[19]  Alexandre A. Ivanov,et al.  Distance-transitive representations of the symmetric groups , 1986, J. Comb. Theory, Ser. B.

[20]  Alexandre Turull,et al.  Algebraic decompositions of commutative association schemes , 1985 .

[21]  Martin W. Liebeck,et al.  The Finite Primitive Permutation Groups of Rank Three , 1986 .

[22]  Paul M. Terwilliger.  A new feasibility condition for distance-regular graphs , 1986, Discret. Math..

[23]  Eiichi Bannai,et al.  On tight $t$-designs in compact symmetric spaces of rank one , 1985 .

[24]  Dennis Stanton,et al.  t-designs in classical association schemes , 1986, Graphs Comb..

[25]  Cheryl E. Praeger,et al.  Distance-transitive graphs of valency five , 1987, Proceedings of the Edinburgh Mathematical Society.

[26]  C. Curtis,et al.  Methods of representation theory--with applications to finite groups and orders , 1981 .

[27]  P. Diaconis,et al.  Time to reach stationarity in the Bernoulli-Laplace diffusion model , 1987 .

[28]  Paul M. Terwilliger.  Root Systems and The Johnson and Hamming Graphs , 1987, Eur. J. Comb..

[29]  ArjehM. Cohen,et al.  A characterization of some geometries of Lie type , 1983 .

[30]  Udo Ott,et al.  On Finite Geometries of Type B3 , 1985, J. Comb. Theory, Ser. A.

[31]  Martin W. Liebeck,et al.  The Affine Permutation Groups of Rank Three , 1987 .

[32]  Cheryl E. Praeger,et al.  DISTANCE TRANSITIVE GRAPHS AND FINITE SIMPLE GROUPS , 1987 .

[33]  Laura M. Chihara.  On the zeros of the Askey-Wilson polynomials, with applications to coding theory , 1987 .

[34]  Thomas Hawkins,et al.  The origins of the theory of group characters , 1971 .

[35]  Jonathan D. H. Smith,et al.  Characters of Finite Quasigroups , 1984, Eur. J. Comb..