SolvetheDyeingProblembyWusMethod用吴方法解决染色问题.PDF

Pure Mathematics 理论数学, 2018, 8(5), 486-490 Published Online September 2018 in Hans. /journal/pm /10.12677/pm.2018.85065 Solve the Dyeing Problem by Wu’s Method Tingting Miao School of Mathematics and System Sciences, Beihang University, Beijing th th th Received: Aug. 13 , 2018; accepted: Aug. 30 , 2018; published: Sep. 6 , 2018 Abstract Dyeing problem is a famous problem in graph theory; the dyeing problem has been solved by Groebner bases method. This text applies the technique of Wu’s method to solve the dyeing prob- lem. The Wu’s method is also called the feature list method; it is a method to deal with polynomial algebra problem proposed by Wu Wenjun in the 1970s. The difference between Wu’s method with Groebner bases method is that Wu’s method completely uses the viewpoint of zero set to deal with the problem, so it is more effective than Groebner bases method in solving dyeing problems; this paper only solves the 3-color problem in the dyeing problem. Keywords The Dyeing Problem, Wu’s Method, Zero Set, Groebner Bases Method, The 3-Color Problem 用吴方法解决染色问题 苗婷婷 北京航空航天大学数学与系统科学学院，北京 收稿日期：2018年8月13 日；录用日期：2018年8月30 日；发布日期：2018年9月6 日 摘 要 染色问题是图论中的著名问题，目前已有人用Groebner基方法解决了染色问题，本文另辟蹊径用吴方法 来解决染色问题。吴方法又称特征列方法，是吴文俊于20世纪70年代提出的处理多项式代数问题的一种 方法。与Groebner基方法不同之处在于，它完全采用零点集的观点来处理问题，因此在染色问题求解方 面较Groebner基方法更有效，本文仅解决染色问题中的三色问题。 文章引用: 苗婷婷. 用吴方法解决染色问题[J]. 理论数学, 2018, 8(5): 486-490. DOI: 10.12677/pm.2018.85065 苗婷婷 关键词 染色问题，吴方法，零点集，Groebner基方法，三色问题 Copyright © 2018 by author and Hans Publishers Inc. This work is licensed under the Creative Commons Attribution Inter