Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 2007, Volume 19, Issue 2, Pages 78–84
DOI: https://doi.org/10.4213/dm82
(Mi dm82)
 

This article is cited in 1 scientific paper (total in 1 paper)

On finite groups close to completely factorisable groups

V. A. Vedernikov, G. V. Savicheva
References:
Abstract: A subgroup $H$ of a group $G$ is called complemented in $G$ if a subgroup $K$ exists in $G$ such that $G=HK$ and $H\cap K=1$. A group is called completely factorisable if each subgroup of the group is complemented.
Let $D(G)$ be the subgroup of a group $G$ generated by all subgroups of $G$ which have no complements in $G$, $Z(G)$ be the centre of the group $G$, and $\Phi(G)$ be the Frattini subgroup of the group $G$. If all subgroups of $G$ are complemented in $G$, then we set $D(G)=1$. Each cyclic subgroup of the Frattini subgroup $\Phi(G)$ of the group $G$ has no complement in $G$, therefore $\Phi(G)\subseteq D(G)$.
In the paper, we obtain a complete description of the structure of a finite group $G$ such that $D(G)\subseteq Z(G)\Phi(G)$.
Received: 24.10.2005
English version:
Discrete Mathematics and Applications, 2007, Volume 17, Issue 3, Pages 261–267
DOI: https://doi.org/10.1515/dma.2007.022
Bibliographic databases:
UDC: 512.54
Language: Russian
Citation: V. A. Vedernikov, G. V. Savicheva, “On finite groups close to completely factorisable groups”, Diskr. Mat., 19:2 (2007), 78–84; Discrete Math. Appl., 17:3 (2007), 261–267
Citation in format AMSBIB
\Bibitem{VedSav07}
\by V.~A.~Vedernikov, G.~V.~Savicheva
\paper On finite groups close to completely factorisable groups
\jour Diskr. Mat.
\yr 2007
\vol 19
\issue 2
\pages 78--84
\mathnet{http://mi.mathnet.ru/dm82}
\crossref{https://doi.org/10.4213/dm82}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2357161}
\zmath{https://zbmath.org/?q=an:1168.20008}
\elib{https://elibrary.ru/item.asp?id=9577330}
\transl
\jour Discrete Math. Appl.
\yr 2007
\vol 17
\issue 3
\pages 261--267
\crossref{https://doi.org/10.1515/dma.2007.022}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34547673125}
Linking options:
  • https://www.mathnet.ru/eng/dm82
  • https://doi.org/10.4213/dm82
  • https://www.mathnet.ru/eng/dm/v19/i2/p78
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:666
    Full-text PDF :303
    References:116
    First page:8
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025