An Upper Bound for the Probability of Generating a Finite Nilpotent Group

Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for every positive integer n > 0, there is a finite group G such that ${\nu}(G)={\frac{1}{n}}$. We also classify all groups G with ${\nu}(G)={\f...

Full description

Saved in:
Bibliographic Details
Published inKyungpook mathematical journal Vol. 63; no. 2; pp. 167 - 173
Main Authors Halimeh Madadi, Seyyed Majid Jafarian Amiri, Hojjat Rostami
Format Journal Article
LanguageKorean
Published 2023
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for every positive integer n > 0, there is a finite group G such that ${\nu}(G)={\frac{1}{n}}$. We also classify all groups G with ${\nu}(G)={\frac{1}{2}}$. Further, we prove that if G is a solvable nonnilpotent group of even order, then ${\nu}(G){\leq}{\frac{p+3}{4p}}$, where p is the smallest odd prime divisor of |G|, and that equality exists if and only if $\frac{G}{Z_{\infty}(G)}$ is isomorphic to the dihedral group of order 2p where Z∞(G) is the hypercenter of G. Finally we find an upper bound for ν(G) in terms of |G| where G ranges over all groups of odd square-free order.
AbstractList Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for every positive integer n > 0, there is a finite group G such that ${\nu}(G)={\frac{1}{n}}$. We also classify all groups G with ${\nu}(G)={\frac{1}{2}}$. Further, we prove that if G is a solvable nonnilpotent group of even order, then ${\nu}(G){\leq}{\frac{p+3}{4p}}$, where p is the smallest odd prime divisor of |G|, and that equality exists if and only if $\frac{G}{Z_{\infty}(G)}$ is isomorphic to the dihedral group of order 2p where Z∞(G) is the hypercenter of G. Finally we find an upper bound for ν(G) in terms of |G| where G ranges over all groups of odd square-free order.
Author Hojjat Rostami
Halimeh Madadi
Seyyed Majid Jafarian Amiri
Author_xml – sequence: 1
  fullname: Halimeh Madadi
– sequence: 2
  fullname: Seyyed Majid Jafarian Amiri
– sequence: 3
  fullname: Hojjat Rostami
BookMark eNqNzr0OgjAUQOHGYCIq73AXRxIoUGREI_iTqIPOBELRG8ktacvg2-vgAzid5RvOnDmkSE6YG8RJ7K9DHjvMDTlPfJEl4Yx5xmATJFGUCiEylx1ygvswSA0bNVILndJgnxKuWjV1gz3aN6gOSklS1xbpATUUSGglnLEflJVkodRqHJZs2tW9kd6vC7Yqdrft3n-hsVhRa_rqmJ8uPOAR_w5xLmIh0uhf9wGyRD2D
ContentType Journal Article
DBID JDI
DEWEY 510
DatabaseName KoreaScience
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
DocumentTitleAlternate An Upper Bound for the Probability of Generating a Finite Nilpotent Group
EISSN 0454-8124
EndPage 173
ExternalDocumentID JAKO202322252264667
GroupedDBID .UV
29L
2WC
5GY
5VS
9ZL
AAKDD
ABDBF
ABPTK
ACIPV
ACYCR
ALMA_UNASSIGNED_HOLDINGS
C1A
E3Z
EBS
EJD
ESX
FRP
GROUPED_DOAJ
JDI
KQ8
KVFHK
OK1
P2P
RNS
TR2
TUS
XSB
~8M
ID FETCH-kisti_ndsl_JAKO2023222522646673
ISSN 1225-6951
IngestDate Fri Dec 22 12:03:59 EST 2023
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Nilpotent subgroup
Soluble group
Probability
Language Korean
LinkModel OpenURL
MergedId FETCHMERGED-kisti_ndsl_JAKO2023222522646673
Notes KISTI1.1003/JNL.JAKO202322252264667
OpenAccessLink http://click.ndsl.kr/servlet/LinkingDetailView?cn=JAKO202322252264667&dbt=JAKO&org_code=O481&site_code=SS1481&service_code=01
ParticipantIDs kisti_ndsl_JAKO202322252264667
PublicationCentury 2000
PublicationDate 2023
PublicationDateYYYYMMDD 2023-01-01
PublicationDate_xml – year: 2023
  text: 2023
PublicationDecade 2020
PublicationTitle Kyungpook mathematical journal
PublicationTitleAlternate Kyungpook mathematical journal
PublicationYear 2023
SSID ssib053376669
ssib000364427
ssj0028604
Score 4.5464983
Snippet Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for...
SourceID kisti
SourceType Open Access Repository
StartPage 167
Title An Upper Bound for the Probability of Generating a Finite Nilpotent Group
URI http://click.ndsl.kr/servlet/LinkingDetailView?cn=JAKO202322252264667&dbt=JAKO&org_code=O481&site_code=SS1481&service_code=01
Volume 63
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELVQucABsYq18gFOUVCzNMsxBapSVEColXqrEhyLlGZRGw7l65lxIiegiu1iRY5l2Xn2-I0zCyHnoHBx22COitHfVJPpTA0cnauO7oa2zV2uMXRwHtxbvZHZH7fHVaJL4V2SB5fP7yv9Sv6DKtQBrugl-wdkZadQAc-AL5SAMJS_wthLlFGWobsIJkeSFoOPc9ikwuhV_D4vIksL82Zf6UZIMmEBzLI0RzuA6vKppKh3S9j_GbpAxDKkaxViopJYsygOX5SBz3wWyXuacLkM0XBjGjGl73NQxEF-eHE0l0166XTq58pTCrQ0juqXDoVHcCkhQQColltGiQ0LSWW2TRWZQl2sWkZt-eg1GakV-TfK41YrMpl8joT95YSSdoN97-4Bh4NKKnoAWxbGEcAAQQ2y7nWuO92aqgdMT5fUClitDZqaK5VxxxKpJeV0QDlBxh7V2MVwm2yVagH1Cox3yNpruks2BxKAxR659RIq0KYCbQpoU3hNa2jTlNMKberTAm0q0aYC7X1y0b0ZXvVUMZRJwhazyYo5GwekkaRJeEgo8D-XO0A620bL9J1WwEFih64dBI7PueYckeb3fR3_1OCEbGBNce10Shr5_C08AyKWB83ym38AoPQ2kQ
link.rule.ids 230,315,786,790,891,4043
linkProvider EBSCOhost
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Upper+Bound+for+the+Probability+of+Generating+a+Finite+Nilpotent+Group&rft.jtitle=Kyungpook+mathematical+journal&rft.au=Halimeh+Madadi&rft.au=Seyyed+Majid+Jafarian+Amiri&rft.au=Hojjat+Rostami&rft.date=2023&rft.issn=1225-6951&rft.eissn=0454-8124&rft.volume=63&rft.issue=2&rft.spage=167&rft.epage=173&rft.externalDBID=n%2Fa&rft.externalDocID=JAKO202322252264667
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1225-6951&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1225-6951&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1225-6951&client=summon