环面上的非三线性问题:周期性
No-three-in-line problem on a torus: periodicity
摘要:
令$τ_{m,n}$表示尺寸为$m \times n$且没有三个共线点的离散环面(离散复曲面网格)上的最大点数。对于$\gcd(m,n)$是素数的情况,值$τ_{m,n}$是已知的。还已知$τ_{m,n} \leq 2\gcd(m,n)$。在本文中,我们推广了一些已知的工具来确定$τ_{m,n}$,也显示了一些新的。使用这些工具,我们证明了序列$(τ_{z,n})_{n \in \mathbb{N}}$是周期的所有固定的$z > 1$。在一般情况下,我们不知道的周期,但是,如果$z = p^a$为$p$素数,那么我们可以绑定它。我们证明了$τ_{p^a,p^{(a-1)p+2}} = 2p^a$,这意味着该序列的周期是$p^b$,其中$b$是最多$(a-1)p+2$。
英文摘要:
Let $τ_{m,n}$ denote the maximal number of points on the discrete torus (discrete toric grid) of sizes $m \times n$ with no three collinear points. The value $τ_{m,n}$ is known for the case where $\gcd(m,n)$ is prime. It is also known that $τ_{m,n} \leq 2\gcd(m,n)$. In this paper we generalize some of the known tools for determining $τ_{m,n}$ and also show some new. Using these tools we prove that the sequence $(τ_{z,n})_{n \in \mathbb{N}}$ is periodic for all fixed $z > 1$. In general, we do not know the period; however, if $z = p^a$ for $p$ prime, then we can bound it. We prove that $τ_{p^a,p^{(a-1)p+2}} = 2p^a$ which implies that the period for the sequence is $p^b$ where $b$ is at most $(a-1)p+2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。