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

DOI10.1163/1569392042572140MaRDI QIDQ3409847zbMATH OpenOpenAlexFDO

Authors V. P. Voronin

Publication date 20 November 2006

Full work available at URL https://doi.org/10.1163/1569392042572140

Mathematics Subject Classification ID

Combinatorial probability (60C05) Distance in graphs (05C12)

Recommendations

• An ``average distance inequality for large subsets of the cube
• The extremal average distance of cubic graphs
• scientific article; zbMATH DE number 140089
• scientific article; zbMATH DE number 3964986
• scientific article; zbMATH DE number 1870235
• On the sum of the squared multiplicities of the distances in a point set over finite spaces
• On thek-ary hypercube tree and its average distance
• On the average volume of subsets in Euclidean \(d\)-space

Cited in

(3)

• Distance matrices of subsets of the Hamming cube
• Classification of subsets of \(B^n\) and additive channels
• An ``average distance inequality for large subsets of the cube

This page was built for publication: On average and typical values of sums of pairwise distances for subsets of vertices of the n-dimensional unit cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3409847)