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, 2009, Volume 21, Issue 4, Pages 30–38
DOI: https://doi.org/10.4213/dm1069 (Mi dm1069) 		 
Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series

O. V. Zubkov
Full-text PDF (104 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1069
Abstract: We obtain a representation of the number $K_n$ of repetition-free Boolean functions of $n$ variables over the elementary basis $\{\&,\vee,\bar{}\,\}$ in the form of a convergent exponential power series. This representation is the simplest representation among a number of similar formulas containing different combinatorial numbers. The obtained result gives a possibility to find the asymptotics of $K_n$.
Received: 20.02.2009
English version:
Discrete Mathematics and Applications, 2009, Volume 19, Issue 5, Pages 505–513
DOI: https://doi.org/10.1515/DMA.2009.033
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: O. V. Zubkov, “Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series”, Diskr. Mat., 21:4 (2009), 30–38; Discrete Math. Appl., 19:5 (2009), 505–513
Citation in format AMSBIB
\Bibitem{Zub09}
\by O.~V.~Zubkov
\paper Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a~convergent series
\jour Diskr. Mat.
\yr 2009
\vol 21
\issue 4
\pages 30--38
\mathnet{http://mi.mathnet.ru/dm1069}
\crossref{https://doi.org/10.4213/dm1069}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2641016}
\elib{https://elibrary.ru/item.asp?id=20730309}
\transl
\jour Discrete Math. Appl.
\yr 2009
\vol 19
\issue 5
\pages 505--513
\crossref{https://doi.org/10.1515/DMA.2009.033}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-75349086159}
Linking options:
  • https://www.mathnet.ru/eng/dm1069
  • https://doi.org/10.4213/dm1069
  • https://www.mathnet.ru/eng/dm/v21/i4/p30
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:416
    Full-text PDF :172
    References:38
    First page:14
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024