港湾图坐标的极小多项式
Minimal Polynomials for the Coordinates of the Harborth Graph
摘要:
Harborth图是已知的4-正则平面单位距离图的最小例子。在本文中,我们给出了一个解析的描述,其顶点的坐标为一个特定的嵌入在欧氏平面。更确切地说,我们展示了如何计算其顶点坐标的极小多项式(借助计算机代数系统),并列出了这些多项式。此外,这些多项式的一些代数性质,和后果的Harborth图的结构被确定。
英文摘要:
The Harborth graph is the smallest known example of a 4-regular planar unit-distance graph. In this paper we give an analytical description of the coordinates of its vertices for a particular embedding in the Euclidean plane. More precisely, we show, how to calculate the minimal polynomials of the coordinates of its vertices (with the help of a computer algebra system), and list those. Furthermore some algebraic properties of these polynomials, and consequences to the structure of the Harborth graph are determined.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。