Skip to main content
Log in

On pseudofrobenius imprimitive association schemes

  • Published:
Journal of Algebraic Combinatorics Aims and scope Submit manuscript

Abstract

An (association) scheme is said to be Frobenius if it is the (orbital) scheme of a Frobenius group. A scheme which has the same tensor of intersection numbers as some Frobenius scheme is said to be pseudofrobenius. We establish a necessary and sufficient condition for an imprimitive pseudofrobenius scheme to be Frobenius. We also prove strong necessary conditions for existence of an imprimitive pseudofrobenius scheme which is not Frobenius. As a byproduct, we obtain a sufficient condition for an imprimitive Frobenius group G with abelian kernel to be determined up to isomorphism only by the character table of G. Finally, we prove that the Weisfeiler-Leman dimension of a circulant graph with n vertices and Frobenius automorphism group is equal to 2 unless \(n\in \{p,p^2,p^3,pq,p^2q\}\), where p and q are distinct primes.

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

Notes

  1. An imprimitivity system I is smaller than an imprimitivity system \(I'\) if each block of \(I'\) is contained in some block of I.

References

  1. André, J.: Eine geometrische Kennzeiehnung imprlmitiver Frobeniusgruppen. Abh. Math. Sem. Univ. Hamburg 51, 120–135 (1981)

    Article  MathSciNet  Google Scholar 

  2. Arvind, V., Köbler, J., Rattan, G., Verbitsky, O.: Graph isomorphism, color refinement, and compactness. Comput. Complexity 26(3), 627–685 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bannai, E., Ito, T.: Algebraic Combinatorics I. Association schemes. The Benjamin/Cummings Publishing Co., Inc, Menlo Park, CA (1984)

  4. Brouwer, A., Cohen, A., Neumaier, A.: Distance-Regular Graphs. Springer, Heidelberg (1989)

    Book  MATH  Google Scholar 

  5. Bourbaki, N.: Elements of Mathematics. Algebra I. Chapters 1-3. Springer, Berlin (1998)

    MATH  Google Scholar 

  6. Camina, A.R.: Some conditions which almost characterize Frobenius groups. Israel J. Math. 31(2), 153–160 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, G., Ponomarenko, I.: Coherent Configurations. Central China Normal University Press (2019). the updated version is available at http://www.pdmi.ras.ru/~inp/ccNOTES.pdf

  8. Chen, G., He, J., Ponomarenko, I., Vasil’ev, A.: A characterization of exceptional pseudocyclic association schemes by multidimensional intersection numbers. Ars Math. Contemp. 21(1), #P1.10 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  9. Evdokimov, S., Ponomarenko, I.: On primitive cellular algebras. J. Math. Sci. (N.-Y.) 107(5), 4172–4191 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Evdokimov, S., Ponomarenko, I.: Schurity of \(S\)-rings over a cyclic group and generalized wreath product of permutation groups. St. Petersburg Math. J. 24(3), 431–460 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Faradz̆ev, I., Klin, M., Muzychuk, M.: Cellular rings and groups of automorphisms of graphs. In: Faradz̆ev, I., et al. (eds.) Investigations in Algebraic Theory of Combinatorial Objects, pp. 1–152. Springer, Berlin (1994)

    Chapter  Google Scholar 

  12. Fuhlbrück, F., Köbler, J., Verbitsky, O.: Identiability of graphs with small color classes by the Weisfeiler-Leman algorithm. In: Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, pp. 43:1–43:18. Dagstühl Publishing, Germany (2020)

  13. Gröhe, M., Neuen, D.: Recent Advances on the Graph Isomorphism Problem, pp. 1–39 (2020). arXiv:2011.01366 [cs.DS]

  14. Higman, D.G.: Characterization of families of rank 3 permutation groups by the subdegrees. II. Arch. Math. 21, 353–361 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  15. Isaacs, I.M.: Finite Group Theory. Graduate studies in Mathematics, vol. 92. American Mathematical Society, Providence (2008)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Ponomarenko, I.: On the separability of cyclotomic schemes over finite field. St. Petersburg Math. J. 32(6), 124–146 (2020)

    MathSciNet  Google Scholar 

  18. Ryabov, G.: On separable abelian \(p\)-groups. Ars Math. Contemp. 17(2), 467–479 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  19. Suzuki, M.: A new type of simple groups of finite order. Proc. Natl. Acad. Sci. USA 46(6), 868–870 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  20. Wielandt, H.: Finite Permutation Groups. Academic Press, New York, London (1964)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Grigory Ryabov.

Additional information

Publisher's Note

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

The second author is supported by Leonard Euler International Mathematical Institute in Saint Petersburg under agreement No. 075-15-2019-1620 with the Ministry of Science and Higher Education of the Russian Federation.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ponomarenko, I., Ryabov, G. On pseudofrobenius imprimitive association schemes. J Algebr Comb 57, 385–402 (2023). https://doi.org/10.1007/s10801-022-01193-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10801-022-01193-4

Keywords

Mathematics Subject Classification

Navigation