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, 2001, Volume 13, Issue 4, Pages 116–121
DOI: https://doi.org/10.4213/dm311 (Mi dm311) 		 
On the number of metric functions of a Boolean cube

A. A. Voronenko
Full-text PDF (531 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm311
Abstract: We obtain the limit of the $2^n$th root (asymptotics of the logarithm) of the number of pseudo-Boolean functions of $n$ variables that map adjacent vertices of the Boolean cube into adjacent vertices of an arbitrary graph, is obtained. This result is extended to mappings of vertices of Cartesian products of arbitrary graphs.
This research was supported by the Russian Foundation for Basic Research, grants 00–01–00351 and 01–01–00266.
Received: 04.07.2001
Bibliographic databases:
UDC: 519.716
Language: Russian
Citation: A. A. Voronenko, “On the number of metric functions of a Boolean cube”, Diskr. Mat., 13:4 (2001), 116–121; Discrete Math. Appl., 11:6 (2001), 643–648
Citation in format AMSBIB
\Bibitem{Vor01}
\by A.~A.~Voronenko
\paper On the number of metric functions of a Boolean cube
\jour Diskr. Mat.
\yr 2001
\vol 13
\issue 4
\pages 116--121
\mathnet{http://mi.mathnet.ru/dm311}
\crossref{https://doi.org/10.4213/dm311}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1901787}
\zmath{https://zbmath.org/?q=an:1054.60008}
\transl
\jour Discrete Math. Appl.
\yr 2001
\vol 11
\issue 6
\pages 643--648
Linking options:
  • https://www.mathnet.ru/eng/dm311
  • https://doi.org/10.4213/dm311
  • https://www.mathnet.ru/eng/dm/v13/i4/p116
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:519
    Full-text PDF :259
    References:35
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024