اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReducibility in the Four-Color Theorem
633
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article we did not give proofs, and instead asserted that we have verified those statements using a computer. Here we give additional details for one of those lemmas, and we include the original computer programs and data as ancillary files accompanying this submission.
قيم البحث
اقرأ أيضاً
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence $x$ over a finite alphabet is ultimately periodic if and only if, for some $n$, the number of different factors of length $n$ appearing in $x$ is less than $n+1$. Attem
pts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let $dge 2$. A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of $ZZ^d$ definable by a first order formula in the Presburger arithmetic $<ZZ;<,+>$. With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse--Hedlund theorem to an arbitrary dimension $d$ and characterize sets of $ZZ^d$ definable in $<ZZ;<,+>$ in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often.
The Friedgut-Kalai-Naor (FKN) theorem states that if $f$ is a Boolean function on the Boolean cube which is close to degree 1, then $f$ is close to a dictator, a function depending on a single coordinate. The author has extended the theorem to the sl
ice, the subset of the Boolean cube consisting of all vectors with fixed Hamming weight. We extend the theorem further, to the multislice, a multicoloured version of the slice. As an application, we prove a stability version of the edge-isoperimetric inequality for settings of parameters in which the optimal set is a dictator.
We show that the mathematical proof of the four color theorem yields a perfect interpretation of the Standard Model of particle physics. The steps of the proof enable us to construct the t-Riemann surface and particle frame which forms the gauge. We
specify well-defined rules to match the Standard Model in a one-to-one correspondence with the topological and algebraic structure of the particle frame. This correspondence is exact - it only allows the particles and force fields to have the observable properties of the Standard Model, giving us a Grand Unified Theory. In this paper, we concentrate on explicitly specifying the quarks, gauge vector bosons, the Standard Model scalar Higgs $H^{0}$ boson and the weak force field. Using all the specifications of our mathematical model, we show how to calculate the values of the Weinberg and Cabibbo angles on the particle frame. Finally, we present our prediction of the Higgs $H^{0}$ boson mass $M_{H^{0}} = 125.992 simeq 126 GeV$, as a direct consequence of the proof of the four color theorem.
In this paper, we apply an equivalent color transform (ECT) for a minimal $k$-coloring of any graph $G$. It contracts each color class of the graph to a single vertex and produces a complete graph $K_k$ for $G$ by removing redundant edges between any
two vertices. Based on ECT, a simple proof for four color theorem for planar graph is then proposed.
For the four-color theorem that has been developed over one and half centuries, all people believe it right but without complete proof convincing all1-3. Former proofs are to find the basic four-colorable patterns on a planar graph to reduce a map co
loring4-6, but the unavoidable set is almost limitless and required recoloring hardly implements by hand7-14. Another idea belongs to formal proof limited to logical operation15. However, recoloring or formal proof way may block people from discovering the inherent essence of a coloring graph. Defining creation and annihilation operations, we show that four colors are sufficient to color a map and how to color it. We find what trapped vertices and boundary-vertices are, and how they decide how many colors to be required in coloring arbitrary maps. We reveal that there is the fourth color for new adding vertex differing from any three coloring vertices in creation operation. To implement a coloring map, we also demonstrate how to color an arbitrary map by iteratively using creation and annihilation operations. We hope our hand proof is beneficial to understand the mechanisms of the four-color theorem.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
