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, 2015, Volume 27, Issue 3, Pages 158–159
DOI: https://doi.org/10.4213/dm1342 (Mi dm1342) 		 
On the asymptotics of the number of repetition-free Boolean functions in the basis $\{\&,\lor,\oplus,\lnot\}$

V. A. Voblyi

Bauman Moscow State Technical University
Full-text PDF (328 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1342
Abstract: We obtain an asymptotic formula for the number $S_n$ of repetition-free Boolean functions of $n$ variables in the basis $\{\&,\lor,\oplus,\lnot\}$ for $n\to\infty: S_n\sim cn^{-3/2}\alpha^nn!$, where $c\approx0.1998398363\;,\alpha\approx7.549773429\;.$
Keywords: repetition-free Boolean function, enumeration, asymptotics.
Received: 31.03.2015
English version:
Discrete Mathematics and Applications, 2017, Volume 27, Issue 1, Pages 55–56
DOI: https://doi.org/10.1515/dma-2017-0006
Bibliographic databases:
Document Type: Article
UDC: 519.175.3
Language: Russian
Citation: V. A. Voblyi, “On the asymptotics of the number of repetition-free Boolean functions in the basis $\{\&,\lor,\oplus,\lnot\}$”, Diskr. Mat., 27:3 (2015), 158–159; Discrete Math. Appl., 27:1 (2017), 55–56
Citation in format AMSBIB
\Bibitem{Vob15}
\by V.~A.~Voblyi
\paper On the asymptotics of the number of repetition-free Boolean functions in the basis $\{\&,\lor,\oplus,\lnot\}$
\jour Diskr. Mat.
\yr 2015
\vol 27
\issue 3
\pages 158--159
\mathnet{http://mi.mathnet.ru/dm1342}
\crossref{https://doi.org/10.4213/dm1342}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3468407}
\elib{https://elibrary.ru/item.asp?id=24849935}
\transl
\jour Discrete Math. Appl.
\yr 2017
\vol 27
\issue 1
\pages 55--56
\crossref{https://doi.org/10.1515/dma-2017-0006}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000403470400006}
Linking options:
  • https://www.mathnet.ru/eng/dm1342
  • https://doi.org/10.4213/dm1342
  • https://www.mathnet.ru/eng/dm/v27/i3/p158
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:451
    Full-text PDF :93
    References:64
    First page:26
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024