对于涂(自然)-邓(映蒲)提出的一个二元组合猜想,已验证了k≤39时的情形,本文在此基础上利用递推归纳的方法,给出了对任意的k,t≤219情形下涂-邓猜想的正确性证明.
Tu-Deng have verified the conjecture under k ≤ 29 by applying the transfer-matrix algorithm on a PC and afterwards France Ph D Jean-Pierre Flori verified it underk ≤ 39. In this paper, based on the verified result under k ≤ 39 , the conjecture in the case of t ≤ 219 , for all k , is proved.