Two classes of piecewise-linear difference equations with eventual periodicity three

In this paper, we will study two classes of difference equations which are piecewise-linear and of similar forms. We will show that all nontrivial solutions of one equation are eventually periodic with prime period three. We will show this result for one case of the second equation.     

Tangent cones and Dini derivatives

We prove a property of the Bouligand tangent cone to the epigraph (or to the graph) of a locally Lipschitz function. It is also shown how this result can be used in determining Dini sequences. Finally, some relationships between such a cone and Dini derivatives are provided.     

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     

极值图论与度序列

本文简要概述极值图论与度序列的最新研究进展，同时提出了一些有待进一步解决的问题和猜想．     

A short proof of a theorem on degree sets of graphs

For a finite simple graph G, we denote the set of degrees of its vertices, known as its degree set, by D(G). Kapoor, Polimeni and Wall [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] have determined the least number of vertices among graphs with a given degree set. We give a very short proof of this result.     

On the Weak Invariance Principle for Stationary Sequences under Projective Criteria

In this paper, we study the central limit theorem and its weak invariance principle for sums of a stationary sequence of random variables, via a martingale decomposition. Our conditions involve the conditional expectation of sums of random variables with respect to the distant past. The results contribute to the clarification of the central limit question for stationary sequences. Magda Peligrad is supported in part by a Charles Phelps Taft research support grant at the Univeristy of Cincinnati and the NSA grant H98230-05-1-0066.     

Using graphs for some discrete tomography problems

Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model.     

正相协列乘积和的重对数律与强大数律

证明了强平稳正相协列乘积和的重对数律与不同分布正相协列乘积和的强大数律,指出了部分和服从强大数律但乘积和未必服从强大数律这一事实,并讨论了定理2中一个条件的必要性．     

B值鞅型序列的一些极限定理

本文讨论了一些B值鞅型序列的强大数定律 ,弱大数定律 ,Lr收敛性及完全收敛性 ,推广了许多熟知的结果 .     

关于B值随机和的完全收敛性的进一步讨论

该文在深入揭示B值非随机和完全收敛性中的一系列等价关系的基础上，给出了随机和完全收敛的充分条件，改进和完善了有关文献中的既有成果，并对矩条件的必要性问题做了初步讨论．