Skip to main content
Log in

Every 4-Equivalenced Association Scheme is Frobenius

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

For a positive integer k, we say that an association scheme \((\varOmega ,S)\) is k-equivalenced if each non-diagonal element of S has valency k. An association scheme \((\varOmega ,S)\) is called Frobenius when the set S is equal to the set of orbitals of a Frobenius group G on a finite set \(\varOmega \). It is known that every k-equivalenced association scheme is Frobenius when k=2, 3. In this paper, we show that every 4-equivalenced association scheme is Frobenius, and give some properties of a 4-equivalenced association scheme.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Zieschang, P.H.: An Algebraic Approach to Association Schemes, Lecture Notes in Mathematics, vol. 1628. Springer, Berlin (1996)

  2. Muzychuk, M., Zieschang, P.-H.: On association schemes all elements of which have valency 1 or 2. Discrete Math. 308(14), 3097–3103 (2008)

    Article  MathSciNet  Google Scholar 

  3. Hirasaka, M., Kim, K.T., Park, J.R.: Every \(3\)-equivalenced association scheme is Frobenius. J. Algebraic Comb. 41(1), 217–228 (2015)

    Article  MathSciNet  Google Scholar 

  4. Hanaki, A., Miyamoto, I.: Classification of association schemes with small vertices. http://math.shinshu-u.ac.jp/~hanaki/as/

  5. Park, J.R.: On 4-equivalenced association schemes. Bull. Korean Math. Soc. 52(5), 1683–1709 (2015)

    Article  MathSciNet  Google Scholar 

  6. Muzychuk, M., Ponomarenko, I.: On pseudocyclic association schemes. Ars Math. Contemp. 5(1), 1–25 (2012)

    Article  MathSciNet  Google Scholar 

  7. Arad, Z., Erez, Y., Muzychuk, M.: On even generalized table algebras. J. Algebraic Comb. 17(2), 163–170 (2003)

    Article  MathSciNet  Google Scholar 

  8. Boykett, T.: Construction of Ferrero pairs of all possible orders. SIAM J. Discrete Math. 14(3), 283–285 (2001)

    Article  MathSciNet  Google Scholar 

  9. Ponomarenko, I., Vasil’ev, A.: Cartan coherent configurations. J. Algebraic Comb. 45(2), 525–552 (2017)

    Article  MathSciNet  Google Scholar 

  10. Ponomarenko, I.N.: Bases of schurian antisymmetric coherent configurations and an isomorphism test for schurian tournaments. J. Math. Sci. 192(3), 316–338 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author would like to express deepest gratitude to the anonymous referees for their careful reading and valuable comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bora Moon.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Moon, B. Every 4-Equivalenced Association Scheme is Frobenius. Graphs and Combinatorics 36, 401–414 (2020). https://doi.org/10.1007/s00373-019-02037-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-019-02037-y

Keywords

Navigation