On Rado's Boundedness Conjecture

We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We then prove the first nontrivial case of Rado's Boundedness Conjecture: if a₁,a₂, and a₃ are integers, and if for every 24-coloring of the positive integers (or even the nonzero rational numbers) there is a monochromatic solution to the equation a₁x₁+a₂x₂+a₃x₃=0, then for every finite coloring of the positive integers there is a monochromatic solution to a₁x₁+a₂x₂+a₃x₃=0.     

On Kemnitz’ conjecture concerning lattice-points in the plane

In 1961, Erdős, Ginzburg and Ziv proved a remarkable theorem stating that each set of 2n−1 integers contains a subset of size n, the sum of whose elements is divisible by n. We will prove a similar result for pairs of integers, i.e. planar lattice-points, usually referred to as Kemnitz’ conjecture. Dedicated to Richard Askey on the occasion of his 70th birthday. 2000 Mathematics Subject Classification Primary—11B50.     

Some Recent Progress and Applications in Graph Minor Theory

In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed. Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number 16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists Supported in part by the Research Grant P1–0297 and by the CRC program On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia     

居加猜想的一个等价命题

文章利用数论中的一些简单结果,建立了居加猜想的一个等价命题。     

关于Nagata猜想的若干研究结果

Nagata猜想是关于满足特定条件的平面曲线的次数的下界的猜测,这些特定要求是指此类曲线过平面上给定的若干个一般点,并在相应点有给定的重数.另展示了使用一种特殊的组合方法来找到这样的下界.特别地,某些情况下的确切下界已经得到.     

十八世纪以来中国太湖流域与英国苏格兰的人才比较研究

将中国人才出得最多的地区之一──太湖流域和西方人才出得最多的地区之一──英国苏格兰（１９８３年人口５１４万）进行比较，发现近３００年来，两地在人才上差距相当大，特别是在自然科学、医学和经济领域方面。在这一期间，苏格兰人对世界的贡献和影响要比太湖流域人大得多。本文介绍了所用的比较研究方法，概述了分类比较研究和学科比较研究结果，并从经济基础、思想观念、政治环境、国际交流、教育和战乱等几个方面探讨了形成这种明显差距的原因。最后提出了对２１世纪中华人才的展望。这一研究可以看作是对“汤因比猜想”研究（从人才角度）以及东亚－西欧人才比较研究的一种先期的“模型试验”。对后者的深入研究将有助于对中华民族未来的自我认识。     

图和补图的荫度

本文研究了图和补图荫度间的关系,并猜想:对p阶简单图G(V,E),有 a(G)+a(G~c)≤1+[p/2] 其中G~c表示G的补图,a(G)表示G的荫度,[x]表示不小于x的最小整数。     

关于等幂和的简捷递推公式

等幂和S m(n)=1 m+2 m+…+n m是一个古老的难题,在G.Giuga猜想等数论问题的研究中有着重要的作用.本文获得了等幂和的两个简捷递推公式,从而改进了陈景润与黎鉴愚的结果.利用这些递推公式可以很快循环地获得等幂和公式,并且给出了第31～40个等幂和公式.     

关于丢番图方程x4+mx2y2+ny4=z2

利用初等数论和Fermat无穷递降法证明了方程x4+mx2y2+ny4=z2在(m,n)=(18,27),(-9,-27).(±9,27),(±18,-27),(18,189),(-36,216)时均无正整数解,并且获得了方程在(m,n)=(士6,24),(±12,-60),(9,-27),(-18,189),(36,216),(-18,27)时的无穷多组正整数解的通解公式,从而完善了Aubry等人的结果.