具有Q-无关方向集的平面构形单位距离问题的注记
A note on the unit distance problem for planar configurations with Q-independent direction set
摘要:
令$T(n)$表示在欧几里得平面$\mathbb{R}^2$中的一组$n$点可以确定的单位距离的最大数目,其中附加条件是由配置确定的不同单位长度方向必须是$\mathbb{Q}$独立的。这与鄂尔多斯单位距离问题有关,但在方向集上有一个简化的附加假设,该假设“一般地”成立。我们证明了$T(n+1)-T(n)$是$n$的汉明重量,即,$n$的二进制展开式中非零二进制系数的数目,并明确地找到$T(n)$的公式。特别地,$T(n)$是$Θ(n log(n))$。此外,我们描述了一个过程,以构建一个集的$n$点在平面上与$\mathbb{Q}$ -独立的单位长度方向集,精确地达到$T(n)$单位距离。在这样做的过程中,我们表明$T(n)$也是相同的最大数量的边缘的顶点的子集的大小$n$确定的可数无限格$\mathbb{Z}^{\infty}$或无限超立方体图$\{0,1\}^{\infty}$。确定T(n)的问题可以看作是一类填充问题或等周问题。
英文摘要:
Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must be $\mathbb{Q}$-independent. This is related to the Erdos unit distance problem but with a simplifying additional assumption on the direction set which holds "generically". We show that $T(n+1)-T(n)$ is the Hamming weight of $n$, i.e., the number of nonzero binary coefficients in the binary expansion of $n$, and find a formula for $T(n)$ explicitly. In particular $T(n)$ is $Θ(n log(n))$. Furthermore we describe a process to construct a set of $n$ points in the plane with $\mathbb{Q}$-independent unit length direction set which achieves exactly $T(n)$ unit distances. In the process of doing this, we show $T(n)$ is also the same as the maximum number of edges a subset of vertices of size $n$ determines in either the countably infinite lattice $\mathbb{Z}^{\infty}$ or the infinite hypercube graph $\{0,1\}^{\infty}$. The problem of determining T(n) can be viewed as either a type of packing or isoperimetric problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。