通过圆上等距点的路径
Paths through equally spaced points on a circle
摘要:
考虑$n$点均匀分布在一个圆上,并且$n-1$弦的路径使用每个点一次。存在$m=\lfloor n/2\rfloor$可能的弦长,因此该路径定义了从$\{1,2,\ldots,m\}$中提取的$n-1$元素的多重集。Buratti证明了当$n$是素数时,所有的多重集都可以实现,Horak和Rosa对所有的$n$提出了一个广义猜想。以前的猜想证明了$n \leq 19$和$n=23$,我们将其扩展到$n\leq 37$(OEIS序列A352568)。第二个问题是确定可以实现的不同(欧几里德)路径长度的数量。对此没有任何推测;我们将现有知识从$n\leq 16$扩展到$n\leq 37$(OEIS序列A030077)。当$n$是素数,素数的两倍,或2的幂,我们证明了两条路有相同的长度,只有当他们有相同的多重弦长。
英文摘要:
Consider $n$ points evenly spaced on a circle, and a path of $n-1$ chords that uses each point once. There are $m=\lfloor n/2\rfloor$ possible chord lengths, so the path defines a multiset of $n-1$ elements drawn from $\{1,2,\ldots,m\}$. The first problem we consider is to characterize the multisets which are realized by some path. Buratti conjectured that all multisets can be realized when $n$ is prime, and a generalized conjecture for all $n$ was proposed by Horak and Rosa. Previously the conjecture was proved for $n \leq 19$ and $n=23$; we extend this to $n\leq 37$ (OEIS sequence A352568). The second problem is to determine the number of distinct (euclidean) path lengths that can be realized. For this there is no conjecture; we extend current knowledge from $n\leq 16$ to $n\leq 37$ (OEIS sequence A030077). When $n$ is prime, twice a prime, or a power of 2, we prove that two paths have the same length only if they have the same multiset of chord lengths.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。