有限度量空间的Stolarsky不变原理
Stolarsky's invariance principle for finite metric spaces
摘要:
Stolarsky的不变原理量化了度量空间的子集与均匀分布的偏差。经典推导球面集,它最近已被研究在一些其他情况下,揭示了一个一般结构背后的各种形式的主要单位。本文考虑有限度量空间的情形,把子集的二次差与其中距离分布的函数联系起来,我们的主要结果与Hamming空间的不变原理的具体形式有关。我们推导出几个等价版本的表达的差异的代码,包括扩展的差异和相关的内核在Krawtchouk的基础。在具有相同基数的所有子集之间具有最小可能的二次差异的码可以自然地被视为空间中的能量最小化子集。使用线性规划,我们找到了几个界限上的最小差异,并给出了最小化配置的例子。特别是,我们证明了所有的二进制完美码有最小的可能的差异。
英文摘要:
Stolarsky's invariance principle quantifies the deviation of a subset of a metric space from the uniform distribution. Classically derived for spherical sets, it has been recently studied in a number of other situations, revealing a general structure behind various forms of the main identity. In this work we consider the case of finite metric spaces, relating the quadratic discrepancy of a subset to a certain function of the distribution of distances in it. Our main results are related to a concrete form of the invariance principle for the Hamming space. We derive several equivalent versions of the expression for the discrepancy of a code, including expansions of the discrepancy and associated kernels in the Krawtchouk basis. Codes that have the smallest possible quadratic discrepancy among all subsets of the same cardinality can be naturally viewed as energy minimizing subsets in the space. Using linear programming, we find several bounds on the minimal discrepancy and give examples of minimizing configurations. In particular, we show that all binary perfect codes have the smallest possible discrepancy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。