Abstract
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).
Similar content being viewed by others
References
Bannai, E., Ito, T.: Albegraic Combinatorics I, Association Schemes. Menlo Park, CA: Benjamin/Cummings 1984
Alon, N., Milman, V.D.:λ 1, isoperimetric inequalities for graphs and super concentrators. J. Comb. Theory (B)38, 73–88 (1985)
Askey, R.: Preface. In: Special Functions: Group Theoretical Aspects and Applications, edited by Askey, R.A., Koornwinder, T.H., Schempp, W. Dordrecht, Holland: Reidel 1984 (See also several articles in this book.)
Bannai, E., Hoggar, S.G.: On tightt-designs in compact symmetric spaces of rank one. Proc. Japan Acad.61, 78–82 (1985) (The full paper, in preparation.)
Bannai, E., Ito, T.: On distance-regular graphs with fixed valency. Graphs and Combinatorics (to appear)
Bannai, E., Ito, T.: On distance-regular graphs with fixed valency, II (submitted)
Bannai, E., Ito, T.: On distance-regular graphs with fixed valency, III, J. Algebra (to appear). IV, V (in preparation)
Biggs, N.L., Boshier, A.G., Shawe-Taylor, J.: Cubic distance-regular graphs (to appear)
Boshier, A.G.: See K. Nomura [47].
Chihara, L.: Applications ot the Askey-Wilson polynomials to association schemes. Ph.D. Thesis. Univ. of Minnesota 1985
Chihara, L.: On the zeros of the Askey-Wilson polynomials, with applications to coding theory. SIAM J. Math. Anal. (to appear)
Chihara, L., Stanton, D.: Association schemes and quadratic transformations for orthogonal polynomials. Graphs and Combinatorics2, 101–112 (1986)
Cohen, A.M., Cooperstein, B.N.: A characterization of some geometries of exceptional Lie type. Geom. Dedicata15, 73–105 (1983)
Curtis, C.W., Reiner, I.: Methods of Representation Theory with Applications to Finite Groups and Orders. New York: John Wiley and Sons 1981
Diaconis, P., Graham, R.L.: The Radon transform onZ k2 . Pacific J. Math.118, 323–345 (1985)
Diaconis, P., Shahshahan, M.: Time to reach stationarity in the Bernoulli-Laplace diffusion model SIAM. J. Math. Anal. (to appear)
Doob, M.: On graph products and association schemes. Utilitas Math.I, 291–302 (1972)
Ferguson, P., Turull, A.: Algebraic decomposition of commutative association schemes. J. Algebra96, 211–229 (1985)
Gardiner, A., Praeger, C.: Distance-regular graphs of valency five. Ars Comb. (to appear)
Gardiner, A., Praeger, C.: Distance-regular graphs of valency six (preprint)
Godsil, C., Shawe-Taylor, J.: Distance-regularized graphs are distance-regular or distance-biregular (to appear)
Hassens, G.: A characterization of buildings of spherical type. Europ. J. Comb. (to appear)
Hassens, G.: Punt-rechte meetkunden van sferische gebouwen (in Flemish). Ph.D. Rijksuniversiteit Gent. 1984
Hawkins, T.: The origin of the theory of Group Characters. Arch. Hist. Exact Sci.7, 142–170 (1971)
Hawkins, T.: New light on Froebenius' Creation of the theory of Group Characters. Arch. Hist. Exact Sci.12, 217–243 (1974)
Hemmeter, J.: Distance-regular graphs and halved graphs. Europ. J. Comb. (to appear)
Hemmeter, J.: The large cliques in the graph of quadratic forms (preprint)
Huang, T.: Some results on the association schemes of bilinear forms. Ph.D. thesis, Ohio State Univ. 1985
Huang, T.: A characterization of the association schemes of bilinear forms. Europ. J. Comb. (to appear)
Inglis, N.: Ph.D. thesis, Univ. of Cambridge 1985
Ismail, M.H., Stanton, D.: On the Askey-Wilson and Rogers polynomials (preprint)
Ivanov, A.A.: Bounding the diameter of a distance-regular graph. Soviet Math. Dokl.28, 149–152 (1983)
Ivanov, A.A.: Distance-transitive representations of the symmetric groups. J. Comb. Theory (B) (to appear)
Ivanov, A.A., Ivanov, A.V., Faradjev, I.A.: Distanct-transitive graphs of Valency 5, 6 and 7 (in Russian). Zhunal Vichisl. Matematiti i Matematicheskoi Fiziki24, 1704–1718 (1984)
Johnson, K., Smith, J.D.H.: Characters of finite quasi groups. Europ. J. Comb.5, 43–50 (1984)
Johnson, K., Smith, J.D.H.: Characters of finite quasi groups II. Europ. J. Comb. (to appear)
Labelle, J.: Talk at Laramie Wyoming AMS meeting, Aug. 1985
Liebeck, M.: The affine permutation groups of rank three (to appear)
Liebeck, M., Saxl, J.: The finite primitive permutation groups of rank three (to appear)
Liebler, R.: Tactical configurations and their generic rings (preprint)
Liebler, R.: A representation theoretic approach to finite geometries of spherical type (preprint)
Moon, A.: The graphsG(n,k) of the Johnson schemes are unique forn ≥ 20. J. Comb. Theory (B)37, 173–188 (1984)
Munemasa, A.: An analogue oft-designs in association schemes of alternating bilinear forms. Graphs and Combinatorics2, 259–267 (1986)
Neumaier, A.: Distance matrices andn-dimensional design. Europ. J. Comb.2, 165–172 (1981)
Neumaier, A.: Classification of graphs by regularity. J. Comb. Theory (B)30, 318–331 (1981)
Neumaier, A.: A characterization of a class of distance-regular graphs. J. Reine Angew. Math.357, 182–192 (1985)
Nomura, K.: Ont-homogeneous permutation sets. Arch. Math.44, 485–487 (1985)
Nomura, K.: A remark on the intersection arrays of distance-regular graphs (preprint). (This paper will be published as a paper by Boshier and Nomura.)
Ott, U.: On finite geometries of typeB 3. J. Comb. Theory (A)39, 209–221 (1985)
Payne, S.E., Thas, J.A.: Finite Generalized Quadrangles. Boston: Pitman 1984
Praeger, C., Saxl, J., Yokoyama, K.: Distance transitive graphs and finite simple groups. Proc. London Math. Soc. (to appear)
Roos, C.: Some remarks on perfect subsets in distance-regular graphs. Delft Prog. Rep.7, 90–97 (1984)
Roos, C.: On anti-designs and designs in an association scheme. Delft Prog. Rep.7, 98–109 (1982)
Shawe-Taylor, J.: Ph.D. thesis, Royal Holloway College 1985
Smith, K.W.: Flag algebras of symmetric design. Ph.D. thesis, Colorado State Univ. 1985
Stanton, D.:t-designs in classical association schemes. Graphs and Combinatorics2, 283–286 (1986)
Teirlinck, L.: Nontrivialt-designs without repeated blocks exist for allt. Discrete Math. (to appear)
Terwilliger, P.: The Johnson graphJ(d, n) is unique if (d, n) ≠ (2, 8). Discrete Math. (to appear)
Terwilliger, P.: Root systems and the Johnson and Hamming graphs. Europ. J. Comb. (to appear)
Terwilliger, P.: Towards a classification of distance-regular graphs with theQ-polynomial property. (preprint)
Terwilliger, P.: A class of distance-regular graphs with theQ-polynomial property, J. Comb. Theory (B) (to appear)
Terwilliger, P.: The classification of distance-regular graphs of type II B, (preprint)
Terwilliger, P.: A new feasibility condition for distance-regular graphs. Discrete Math. (to appear)
Terwilliger, P.: A characterization ofP- andQ-polynomial association schemes. (preprint)
Terwilliger, P.: Counting 4-vertex configurations inP- andQ-polynomial association schemes. Groups and Geometries (to appear)
Viennot, G.: Une theorie combinatoire des polynomes orthogonaux generaux. In: Lecture Notes, UQAM, 1983
Weiss, R.: Distance-transitive graphs and generalized polygons. Arch. Math.45, 186–192 (1985)
Weiss, R.: On distance-transitive graphs. Bull. London Math. Soc. (to appear)
Author information
Authors and Affiliations
Additional information
Supported in part by NSF grant DMS 8503761.
Rights and permissions
About this article
Cite this article
Bannai, E., Ito, T. Current research on algebraic combinatorics. Graphs and Combinatorics 2, 287–308 (1986). https://doi.org/10.1007/BF01788104
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788104