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, 2004, Volume 16, Issue 3, Pages 141–152
DOI: https://doi.org/10.4213/dm168
(Mi dm168)
 

On average and typical values of sums of pairwise distances for subsets of vertices of the $n$-dimensional unit cube

V. P. Voronin
References:
Abstract: We study the question on average and typical values of sums of pairwise Hamming distances for subsets of vertices of the $n$-dimensional unit cube. We suggest an approach to the problem of evaluation of average and typical values of arbitrary functionals defined on subsets of a finite set as the sum of values assigned to ordered pairs of elements of this set; general formulas for this case are obtained. We find average and typical values of sums of pairwise distances in the case of all subsets of vertices of the $n$-dimensional unit cube and of sums of pairwise distances for subsets of vertices of fixed cardinality.
This research was supported by the Russian Foundation for Basic Research, grant 01–01–00266Б.
Received: 10.11.2003
English version:
Discrete Mathematics and Applications, 2004, Volume 14, Issue 5, Pages 509–520
DOI: https://doi.org/10.1515/1569392042572140
Bibliographic databases:
UDC: 519.6
Language: Russian
Citation: V. P. Voronin, “On average and typical values of sums of pairwise distances for subsets of vertices of the $n$-dimensional unit cube”, Diskr. Mat., 16:3 (2004), 141–152; Discrete Math. Appl., 14:5 (2004), 509–520
Citation in format AMSBIB
\Bibitem{Vor04}
\by V.~P.~Voronin
\paper On average and typical values of sums of pairwise distances for subsets of vertices of the $n$-dimensional unit cube
\jour Diskr. Mat.
\yr 2004
\vol 16
\issue 3
\pages 141--152
\mathnet{http://mi.mathnet.ru/dm168}
\crossref{https://doi.org/10.4213/dm168}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2109802}
\zmath{https://zbmath.org/?q=an:1104.05025}
\transl
\jour Discrete Math. Appl.
\yr 2004
\vol 14
\issue 5
\pages 509--520
\crossref{https://doi.org/10.1515/1569392042572140}
Linking options:
  • https://www.mathnet.ru/eng/dm168
  • https://doi.org/10.4213/dm168
  • https://www.mathnet.ru/eng/dm/v16/i3/p141
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:350
    Full-text PDF :209
    References:34
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024