Skip to main content
Log in

Current research on algebraic combinatorics

Supplements to our Book, Algebraic Combinatorics I

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bannai, E., Ito, T.: Albegraic Combinatorics I, Association Schemes. Menlo Park, CA: Benjamin/Cummings 1984

    Google Scholar 

  2. Alon, N., Milman, V.D.:λ 1, isoperimetric inequalities for graphs and super concentrators. J. Comb. Theory (B)38, 73–88 (1985)

    Google Scholar 

  3. 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.)

    Google Scholar 

  4. 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.)

    Google Scholar 

  5. Bannai, E., Ito, T.: On distance-regular graphs with fixed valency. Graphs and Combinatorics (to appear)

  6. Bannai, E., Ito, T.: On distance-regular graphs with fixed valency, II (submitted)

  7. Bannai, E., Ito, T.: On distance-regular graphs with fixed valency, III, J. Algebra (to appear). IV, V (in preparation)

  8. Biggs, N.L., Boshier, A.G., Shawe-Taylor, J.: Cubic distance-regular graphs (to appear)

  9. Boshier, A.G.: See K. Nomura [47].

  10. Chihara, L.: Applications ot the Askey-Wilson polynomials to association schemes. Ph.D. Thesis. Univ. of Minnesota 1985

  11. Chihara, L.: On the zeros of the Askey-Wilson polynomials, with applications to coding theory. SIAM J. Math. Anal. (to appear)

  12. Chihara, L., Stanton, D.: Association schemes and quadratic transformations for orthogonal polynomials. Graphs and Combinatorics2, 101–112 (1986)

    Google Scholar 

  13. Cohen, A.M., Cooperstein, B.N.: A characterization of some geometries of exceptional Lie type. Geom. Dedicata15, 73–105 (1983)

    Google Scholar 

  14. Curtis, C.W., Reiner, I.: Methods of Representation Theory with Applications to Finite Groups and Orders. New York: John Wiley and Sons 1981

    Google Scholar 

  15. Diaconis, P., Graham, R.L.: The Radon transform onZ k2 . Pacific J. Math.118, 323–345 (1985)

    Google Scholar 

  16. Diaconis, P., Shahshahan, M.: Time to reach stationarity in the Bernoulli-Laplace diffusion model SIAM. J. Math. Anal. (to appear)

  17. Doob, M.: On graph products and association schemes. Utilitas Math.I, 291–302 (1972)

    Google Scholar 

  18. Ferguson, P., Turull, A.: Algebraic decomposition of commutative association schemes. J. Algebra96, 211–229 (1985)

    Google Scholar 

  19. Gardiner, A., Praeger, C.: Distance-regular graphs of valency five. Ars Comb. (to appear)

  20. Gardiner, A., Praeger, C.: Distance-regular graphs of valency six (preprint)

  21. Godsil, C., Shawe-Taylor, J.: Distance-regularized graphs are distance-regular or distance-biregular (to appear)

  22. Hassens, G.: A characterization of buildings of spherical type. Europ. J. Comb. (to appear)

  23. Hassens, G.: Punt-rechte meetkunden van sferische gebouwen (in Flemish). Ph.D. Rijksuniversiteit Gent. 1984

  24. Hawkins, T.: The origin of the theory of Group Characters. Arch. Hist. Exact Sci.7, 142–170 (1971)

    Google Scholar 

  25. Hawkins, T.: New light on Froebenius' Creation of the theory of Group Characters. Arch. Hist. Exact Sci.12, 217–243 (1974)

    Google Scholar 

  26. Hemmeter, J.: Distance-regular graphs and halved graphs. Europ. J. Comb. (to appear)

  27. Hemmeter, J.: The large cliques in the graph of quadratic forms (preprint)

  28. Huang, T.: Some results on the association schemes of bilinear forms. Ph.D. thesis, Ohio State Univ. 1985

  29. Huang, T.: A characterization of the association schemes of bilinear forms. Europ. J. Comb. (to appear)

  30. Inglis, N.: Ph.D. thesis, Univ. of Cambridge 1985

  31. Ismail, M.H., Stanton, D.: On the Askey-Wilson and Rogers polynomials (preprint)

  32. Ivanov, A.A.: Bounding the diameter of a distance-regular graph. Soviet Math. Dokl.28, 149–152 (1983)

    Google Scholar 

  33. Ivanov, A.A.: Distance-transitive representations of the symmetric groups. J. Comb. Theory (B) (to appear)

  34. 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)

    Google Scholar 

  35. Johnson, K., Smith, J.D.H.: Characters of finite quasi groups. Europ. J. Comb.5, 43–50 (1984)

    Google Scholar 

  36. Johnson, K., Smith, J.D.H.: Characters of finite quasi groups II. Europ. J. Comb. (to appear)

  37. Labelle, J.: Talk at Laramie Wyoming AMS meeting, Aug. 1985

  38. Liebeck, M.: The affine permutation groups of rank three (to appear)

  39. Liebeck, M., Saxl, J.: The finite primitive permutation groups of rank three (to appear)

  40. Liebler, R.: Tactical configurations and their generic rings (preprint)

  41. Liebler, R.: A representation theoretic approach to finite geometries of spherical type (preprint)

  42. Moon, A.: The graphsG(n,k) of the Johnson schemes are unique forn ≥ 20. J. Comb. Theory (B)37, 173–188 (1984)

    Google Scholar 

  43. Munemasa, A.: An analogue oft-designs in association schemes of alternating bilinear forms. Graphs and Combinatorics2, 259–267 (1986)

    Google Scholar 

  44. Neumaier, A.: Distance matrices andn-dimensional design. Europ. J. Comb.2, 165–172 (1981)

    Google Scholar 

  45. Neumaier, A.: Classification of graphs by regularity. J. Comb. Theory (B)30, 318–331 (1981)

    Google Scholar 

  46. Neumaier, A.: A characterization of a class of distance-regular graphs. J. Reine Angew. Math.357, 182–192 (1985)

    Google Scholar 

  47. Nomura, K.: Ont-homogeneous permutation sets. Arch. Math.44, 485–487 (1985)

    Google Scholar 

  48. 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.)

  49. Ott, U.: On finite geometries of typeB 3. J. Comb. Theory (A)39, 209–221 (1985)

    Google Scholar 

  50. Payne, S.E., Thas, J.A.: Finite Generalized Quadrangles. Boston: Pitman 1984

    Google Scholar 

  51. Praeger, C., Saxl, J., Yokoyama, K.: Distance transitive graphs and finite simple groups. Proc. London Math. Soc. (to appear)

  52. Roos, C.: Some remarks on perfect subsets in distance-regular graphs. Delft Prog. Rep.7, 90–97 (1984)

    Google Scholar 

  53. Roos, C.: On anti-designs and designs in an association scheme. Delft Prog. Rep.7, 98–109 (1982)

    Google Scholar 

  54. Shawe-Taylor, J.: Ph.D. thesis, Royal Holloway College 1985

  55. Smith, K.W.: Flag algebras of symmetric design. Ph.D. thesis, Colorado State Univ. 1985

  56. Stanton, D.:t-designs in classical association schemes. Graphs and Combinatorics2, 283–286 (1986)

    Google Scholar 

  57. Teirlinck, L.: Nontrivialt-designs without repeated blocks exist for allt. Discrete Math. (to appear)

  58. Terwilliger, P.: The Johnson graphJ(d, n) is unique if (d, n) ≠ (2, 8). Discrete Math. (to appear)

  59. Terwilliger, P.: Root systems and the Johnson and Hamming graphs. Europ. J. Comb. (to appear)

  60. Terwilliger, P.: Towards a classification of distance-regular graphs with theQ-polynomial property. (preprint)

  61. Terwilliger, P.: A class of distance-regular graphs with theQ-polynomial property, J. Comb. Theory (B) (to appear)

  62. Terwilliger, P.: The classification of distance-regular graphs of type II B, (preprint)

  63. Terwilliger, P.: A new feasibility condition for distance-regular graphs. Discrete Math. (to appear)

  64. Terwilliger, P.: A characterization ofP- andQ-polynomial association schemes. (preprint)

  65. Terwilliger, P.: Counting 4-vertex configurations inP- andQ-polynomial association schemes. Groups and Geometries (to appear)

  66. Viennot, G.: Une theorie combinatoire des polynomes orthogonaux generaux. In: Lecture Notes, UQAM, 1983

  67. Weiss, R.: Distance-transitive graphs and generalized polygons. Arch. Math.45, 186–192 (1985)

    Google Scholar 

  68. Weiss, R.: On distance-transitive graphs. Bull. London Math. Soc. (to appear)

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported in part by NSF grant DMS 8503761.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788104

Keywords

Navigation