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


Diskr. Mat., 2015, Volume 27, Issue 3, Pages 158–159 (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

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.

DOI: https://doi.org/10.4213/dm1342

Full text: PDF file (328 kB)
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2017, 27:1, 55–56

Bibliographic databases:

UDC: 519.175.3
Received: 31.03.2015

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://www.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{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000403470400006}


Linking options:
  • http://mi.mathnet.ru/eng/dm1342
  • https://doi.org/10.4213/dm1342
  • http://mi.mathnet.ru/eng/dm/v27/i3/p158

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретная математика
    Number of views:
    This page:273
    Full text:36
    References:36
    First page:26

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022