EUVIMEDEUVIMED entdecken
Crossref

Solvability and maximal cyclic subgroups

Raimundo Bastos, Deyfila Lima

Journal of Algebra and Its Applications · 10.07.2026

DOI: 10.1142/s0219498828500028 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algebra and Its Applications, online erschienen am 10.07.2026. Verfasst von Raimundo Bastos und 1 weiteren Autor:innen. Gefördert von: Conselho Nacional de Desenvolvimento Científico e Tecnológico, Fundação de Apoio à Pesquisa do Distrito Federal, Fundação Coordenação de Aperfeiçoamento de Pessoal de Nível Superior.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For a finite group [Formula: see text], let [Formula: see text] denote the smallest index of a maximal cyclic subgroup of [Formula: see text], with [Formula: see text] if [Formula: see text] is cyclic. We prove that [Formula: see text] implies that [Formula: see text] is solvable, and that this bound is sharp. We also obtain bounds for the derived length of finite solvable groups in terms of [Formula: see text], improving earlier estimates based on the number [Formula: see text] of maximal cyclic subgroups. In particular, for finite [Formula: see text]-groups, we obtain a bound of order [Formula: see text].

Förderung

  • Conselho Nacional de Desenvolvimento Científico e Tecnológico
  • Fundação de Apoio à Pesquisa do Distrito Federal
  • Fundação Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Zitieren

APA

Bastos, R., & Lima, D. (2026). Solvability and maximal cyclic subgroups. Journal of Algebra and Its Applications. https://doi.org/10.1142/s0219498828500028

Vancouver

Bastos R, Lima D. Solvability and maximal cyclic subgroups. Journal of Algebra and Its Applications. 2026. doi:10.1142/s0219498828500028

BibTeX
@article{Bastos2026,
  author = {Bastos, Raimundo and Lima, Deyfila},
  title = {Solvability and maximal cyclic subgroups},
  journal = {Journal of Algebra and Its Applications},
  year = {2026},
  doi = {10.1142/s0219498828500028}
}
Kostenlos starten →