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

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 1, Pages 76–88
DOI: https://doi.org/10.4213/dm10 (Mi dm10) 		 
An upper bound for the number of product-free sets in a class of groups

T. G. Petrosyan
Full-text PDF (151 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm10
Abstract: We obtain a bound for the number of product-free sets in finite groups containing a normal subgroup of prime index.
Received: 15.06.2006
English version:
Discrete Mathematics and Applications, 2007, Volume 17, Issue 1, Pages 57–70
DOI: https://doi.org/10.1515/DMA.2007.007
Bibliographic databases:
UDC: 519.6
Language: Russian
Citation: T. G. Petrosyan, “An upper bound for the number of product-free sets in a class of groups”, Diskr. Mat., 19:1 (2007), 76–88; Discrete Math. Appl., 17:1 (2007), 57–70
Citation in format AMSBIB
\Bibitem{Pet07}
\by T.~G.~Petrosyan
\paper An upper bound for the number of product-free sets in a~class of groups
\jour Diskr. Mat.
\yr 2007
\vol 19
\issue 1
\pages 76--88
\mathnet{http://mi.mathnet.ru/dm10}
\crossref{https://doi.org/10.4213/dm10}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2325906}
\zmath{https://zbmath.org/?q=an:1168.20010}
\elib{https://elibrary.ru/item.asp?id=9468389}
\transl
\jour Discrete Math. Appl.
\yr 2007
\vol 17
\issue 1
\pages 57--70
\crossref{https://doi.org/10.1515/DMA.2007.007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34248174286}
Linking options:
  • https://www.mathnet.ru/eng/dm10
  • https://doi.org/10.4213/dm10
  • https://www.mathnet.ru/eng/dm/v19/i1/p76
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024