On the number of epi-, mono- and homomorphisms of groups

Cover Page

Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

It is well known that the number of homomorphisms from a group $F$ to a group $G$ is divisible by the greatest common divisor of the order of $G$ and the exponent of $F/[F,F]$. We study the question of what can be said about the number of homomorphisms satisfying certain natural conditions like injectivity or surjectivity. A simple non-trivial consequence of our results is the fact that in any finite group the number of generating pairs $(x,y)$ such that $x^3=1=y^5$ is divisible by the greatest common divisor of fifteen and the order of the group $[G,G]\cdot\{g^{15}\mid g\in G\}$.

Full Text

Restricted Access

About the authors

Elena Konstantinovna Brusyanskaya

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics; Moscow Center for Fundamental and Applied Mathematics

without scientific degree, no status

Anton Aleksandrovich Klyachko

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics; Moscow Center for Fundamental and Applied Mathematics

Email: anton.klyachko@gmail.com
Candidate of physico-mathematical sciences, no status

References

  1. G. Frobenius, “Verallgemeinerung des Sylow'schen Satzes”, Sitzungsber. Preuss. Akad. Wiss. Berlin, 1895 (1895), 981–993
  2. R. Andreev, A translation of “Verallgemeinerung des Sylow'schen Satzes” by F. G. Frobenius
  3. L. Solomon, “The solution of equations in groups”, Arch. Math. (Basel), 20:3 (1969), 241–247
  4. S. Iwasaki, “A note on the $n$th roots ratio of a subgroup of a finite group”, J. Algebra, 78:2 (1982), 460–474
  5. G. Frobenius, “Über einen Fundamentalsatz der Gruppentheorie”, Sitzungsber. Preuss. Akad. Wiss. Berlin, 1903 (1903), 987–991
  6. P. Hall, “On a theorem of Frobenius”, Proc. London Math. Soc., 40 (1936), 468–501
  7. A. Kulakoff, “Einige Bemerkungen zur Arbeit: “On a theorem of Frobenius” von P. Hall”, Матем. сб., 3(45):2 (1938), 403–405
  8. S. K. Sehgal, “On P. Hall's generalisation of a theorem of Frobenius”, Proc. Glasgow Math. Assoc., 5:3 (1962), 97–100
  9. I. M. Isaacs, “Systems of equations and generalized characters in groups”, Canadian J. Math., 22:5 (1970), 1040–1046
  10. K. S. Brown, J. Thevenaz, “A generalization of Sylow's third theorem”, J. Algebra, 115:2 (1988), 414–430
  11. T. Yoshida, “$|{operatorname{Hom}(A, G)}|$”, J. Algebra, 156:1 (1993), 125–156
  12. С. П. Струнков, “К теории уравнений на конечных группах”, Изв. РАН. Сер. матем., 59:6 (1995), 171–180
  13. T. Asai, Yu. Takegahara, “$|{operatorname{Hom}(A,G)}|$. IV”, J. Algebra, 246:2 (2001), 543–563
  14. J. Sato, T. Asai, “On the $n$-th roots of a double coset of a finite group”, J. Sch. Sci. Eng. Kinki Univ., 43 (2007), 1–4
  15. A. Amit, U. Vishne, “Characters and solutions to equations in finite groups”, J. Algebra Appl., 10:4 (2011), 675–686
  16. C. Gordon, F. Rodriguez-Villegas, “On the divisibility of $#operatorname{Hom}(Gamma, G)$ by $|G|$”, J. Algebra, 350:1 (2012), 300–307
  17. T. Asai, N. Chigira, T. Niwasaki, Yu. Takegahara, “On a theorem of P. Hall”, J. Group Theory, 16:1 (2013), 69–80
  18. A. A. Klyachko, A. A. Mkrtchyan, “How many tuples of group elements have a given property?”, With an appendix by Dmitrii V. Trushin, Internat. J. Algebra Comput., 24:4 (2014), 413–428
  19. A. A. Klyachko, A. A. Mkrtchyan, “Strange divisibility in groups and rings”, Arch. Math., 108:5 (2017), 441–451
  20. E. K. Brusyanskaya, A. A. Klyachko, A. V. Vasil'ev, “What do Frobenius's, Solomon's, and Iwasaki's theorems on divisibility in groups have in common?”, Pacific J. Math., 302:2 (2019), 437–452
  21. A. A. Klyachko, M. A. Ryabtseva, “The dimension of solution sets to systems of equations in algebraic groups”, Israel J. Math., 237:1 (2020), 141–154
  22. R. Brauer, “On a theorem of Frobenius”, Amer. Math. Monthly, 76:1 (1969), 12–15

Copyright (c) 2022 Брусянская Е.K., Клячко А.A.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies