Goldbach分解图的例外自治分支
Exceptional autonomous components of Goldbach factorization graphs
摘要:
我们引入了哥德巴赫分解图(GFG)$F_n$的概念,它可以为每个大于2的偶数$n$构造。证明了如果$n$不满足二进制哥德巴赫猜想(BGC),则$F_n$包含一个特殊的源强连通分量(例外自治分量,EAC).我们分析的存在性和性质的EAC使用演绎和计算方法。特别地,我们证明了存在两个顶点诱导的EAC。使用计算机辅助搜索,我们表明,$n \leq 10^8$有6个EAC,每个不同的GFG内,它们位于检查范围的相对开始,即$n\in\{128,1718,1862,1928,2200,6142\}$。使用经典的图形算法,约束编程方法,和元启发式方法,我们已经准备好了一个仓库的图纸和一些选定的属性,发现EAC和GFGs,其中包含它们。EAC的概念与BGC有关,但更一般地说,它代表了素数在加法和乘法相结合的关系下的有趣的自共轭。
英文摘要:
We introduce a concept of a Goldbach factorization graph (GFG) $F_n$, which can be constructed for each even integer $n$ greater than 2. We prove that, if $n$ does not satisfy the binary Goldbach conjecture (BGC), then $F_n$ contains a special source strongly connected component (exceptional autonomous component, EAC). We analyse existence and properties of EACs using deductive and computational approaches. In particular, we prove that there exists exactly one EAC induced by two vertices. Using computer-aided search, we show that for $n \leq 10^8$ there are 6 EACs, each inside a different GFG, and they are located at the relative beginning of the checked range, namely, for $n\in\{128,1718,1862,1928,2200,6142\}$. Using classic graph algorithms, the constraint programming method, and metaheuristic approaches, we have prepared a repository of drawings and some selected properties of the found EACs and GFGs which contain them. The concept of EAC relates to the BGC, but more generally, it represents interesting self-conjugation of prime numbers under a relation which combines addition and multiplication.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。