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, 2018, Volume 30, Issue 3, Pages 117–126
DOI: https://doi.org/10.4213/dm1502
(Mi dm1502)
 

Asymptotics for the logarithm of the number of $k$-solution-free sets in Abelian groups

A. A. Sapozhenko, V. G. Sargsyan

Lomonosov Moscow State University
References:
Abstract: A family $(A_1,\dots,A_k)$ of subsets of a group $G$ is called $k$-solution-free family if the equation $x_1+\dots+x_k=0$ has no solution in $(A_1,\dots,A_k)$ such that $x_1\in A_1,\dots,x_k\in A_k$. We find the asymptotic behavior for the logarithm of the number of $k$-solution-free families in Abelian groups.
Keywords: set, characteristic function, group, progression, coset.
Funding agency Grant number
Russian Foundation for Basic Research 16-01-00593A
Received: 05.02.2018
English version:
Discrete Mathematics and Applications, 2019, Volume 29, Issue 6, Pages 401–407
DOI: https://doi.org/10.1515/dma-2019-0038
Bibliographic databases:
Document Type: Article
UDC: 519.115
Language: Russian
Citation: A. A. Sapozhenko, V. G. Sargsyan, “Asymptotics for the logarithm of the number of $k$-solution-free sets in Abelian groups”, Diskr. Mat., 30:3 (2018), 117–126; Discrete Math. Appl., 29:6 (2019), 401–407
Citation in format AMSBIB
\Bibitem{SapSar18}
\by A.~A.~Sapozhenko, V.~G.~Sargsyan
\paper Asymptotics for the logarithm of the number of $k$-solution-free sets in Abelian groups
\jour Diskr. Mat.
\yr 2018
\vol 30
\issue 3
\pages 117--126
\mathnet{http://mi.mathnet.ru/dm1502}
\crossref{https://doi.org/10.4213/dm1502}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3849372}
\elib{https://elibrary.ru/item.asp?id=35410174}
\transl
\jour Discrete Math. Appl.
\yr 2019
\vol 29
\issue 6
\pages 401--407
\crossref{https://doi.org/10.1515/dma-2019-0038}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000504837800006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85078112605}
Linking options:
  • https://www.mathnet.ru/eng/dm1502
  • https://doi.org/10.4213/dm1502
  • https://www.mathnet.ru/eng/dm/v30/i3/p117
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:344
    Full-text PDF :46
    References:41
    First page:18
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024