ﻻ يوجد ملخص باللغة العربية
Let $D$ denote the distance matrix for an $n+1$ point metric space $(X,d)$. In the case that $X$ is an unweighted metric tree, the sum of the entries in $D^{-1}$ is always equal to $2/n$. Such trees can be considered as affinely independent subsets of the Hamming cube $H_n$, and it was conjectured that the value $2/n$ was minimal among all such subsets. In this paper we confirm this conjecture and give a geometric interpretation of our result which applies to any subset of $H_n$.
Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points ${ x_{0}, x_{1}, ldots , x_{n} }$ in the Hamming cube $H_{n} = ( { 0,1 }^{n}, ell_{1} )$. In this article we derive a formula
The Lipschitz geometry of segments of the infinite Hamming cube is studied. Tight estimates on the distortion necessary to embed the segments into spaces of continuous functions on countable compact metric spaces are given. As an application, the fir
$H_q(n,d)$ is defined as the graph with vertex set ${mathbb Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$
For $ninmathbb N$ let $Theta^{(n)}$ be a random vector uniformly distributed on the unit sphere $mathbb S^{n-1}$, and consider the associated random probability measure $mu_{Theta^{(n)}}$ given by setting [ mu_{Theta^{(n)}}(A) := mathbb{P} left[ lang
Our starting point is an improved version of a result of D. Hajela related to a question of Koml{o}s: we show that if $f(n)$ is a function such that $limlimits_{ntoinfty }f(n)=infty $ and $f(n)=o(n)$, there exists $n_0=n_0(f)$ such that for every $ng