Skip to main content
SpringerLink
Log in

Regular weights and the Johnson scheme

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

This work addresses existence of weighted coherent configurations (cc’s) in the special case of the Johnson schemes,J(n, k). Many examples of weighted cc’s occur in the context of a permutation representation of a group which affords the cc. We determine the ranks of the weighted Johnson schemes which arise in this “group case” in connection with the alternating groupA n . The association schemeJ(n, 2) has rank 3, with the triangular graphT(n) as one of its graphs. Conditions on feasible parameters for regular, full rank weights onT(n) are established. We describe two infinite families of such feasible parameters.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. C. Bussemaker, R. A. Mathon and J. J. Seidel,Tables of two-graphs, Report Techn. Univ. Eindhoven79-WSK-05 (1979).

  2. J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson,Atlas of Finite Groups, Clarendon Press, Oxford and New York, 1985.

    MATH  Google Scholar 

  3. P. Delsarte, J. M. Goethals and J. J. Seidel,Bounds for systems of lines, and Jacobi polynomials, Philips Research Report30 (1975), 91–105.

    MATH  Google Scholar 

  4. D. G. Higman,Coherent algebras, Linear Algebra and its Applications93 (1987), 209–239.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. G. Higman,Weights and t-graphs, Bulletin de la Société Mathématique de BelgiqueXLII (1990), 501–521.

    MathSciNet  Google Scholar 

  6. A. D. Sankey,Regular weights of full rank on strongly regular graphs, Israel Journal of Mathematics95 (1996), 1–23.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. D. Sankey,Regular weights on strongly regular graphs, Ph.D. thesis, University of Michigan, 1992.

  8. J. J. Seidel, Personal communication.

  9. J. J. Seidel,Polytopes and non-Euclidian geometry, Mitteilungen aus dem Mathematischen Seminar Giessen163 (1984), 1–17.

    MathSciNet  Google Scholar 

  10. J. J. Seidel,A survey of two-graphs, Proc. Intern. Colloqu. Teorie Combinatorie (Rome 1973), Tomo I Accad. Naz. Lincei (1976), 481–511.

  11. J. J. Seidel and D. E. Taylor,Two-graphs, a second survey, inAlgebraic Methods in Graph Theory, Szeged (Hungary 1978), North-Holland, Amsterdam and New York, 1981, pp. 689–711.

    Google Scholar 

  12. D. E. Taylor,Regular twographs, Proceedings of the London Mathematical Society35 (1977), 257–274.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Slippery Rock University, 16057, Slippery Rock, PA, USA

    A. D. Sankey

Authors
  1. A. D. Sankey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. D. Sankey.

Additional information

Research supported by the Department of Education and the Rackham Graduate School of the University of Michigan as part of Ph.D. thesis written under the direction of D. G. Higman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sankey, A.D. Regular weights and the Johnson scheme. Isr. J. Math. 97, 11–28 (1997). https://doi.org/10.1007/BF02774023

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation