A conjecture of Erd?s on graph Ramsey numbers

The Ramsey number r(G) of a graph G is the minimum N such that every red–blue coloring of the edges of the complete graph on N vertices contains a monochromatic copy of G. Determining or estimating these numbers is one of the central problems in combinatorics.One of the oldest results in Ramsey Theory, proved by Erd?s and Szekeres in 1935, asserts that the Ramsey number of the complete graph with m edges is at most . Motivated by this estimate Erd?s conjectured, more than a quarter century ago, that there is an absolute constant c such that for any graph G with m edges and no isolated vertices. In this short note we prove this conjecture.     

奇素数幂中的优美指数猜想

对于不小于7素数p,设1≤k≤p-1,则使用同余方法可证明方程n=pkp-1d（n）无正整数解,从而pkp-1不是优美指数,进而可以肯定＂存在无穷多个正整数不是优美指数＂.     

Freeness for 13 lines arrangements is combinatorial

We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane.     

Stable intersection of affine Cantor sets defined by two expanding maps

It is shown that in the context of affine Cantor sets with two increasing maps, the arithmetic sum of both of its elements is a Cantor set otherwise, it is a closure of countable union of nontrivial intervals. Also, a new family of pairs of affine Cantor sets is introduced such that each element of it has stable intersection. At the end, pairs of affine Cantor sets are characterized such that the sum of elements of each pair is a closed interval.     

二部图形式的Erd\H{O}s-S\'{o}s猜想

二部图形式的Erd\H{O}s-S\''{o}s猜想     

Optimality conditions at junctions of singular and nonsingular controls

Some necessary conditions for the optimality of junctions between singular and nonsingular subarcs arising in optimal control problems are well established. The second part of McDanell's conjecture has been proved false. The first part still awaits verification or otherwise. This paper briefly summarizes previous work and presents some evidence to suggest that the first part of the conjecture is also false.     

Uncertainty principle and quantum Fisher information

A family of inequalities, related to the uncertainty principle, has been recently proved by S. Luo, Z. Zhang, Q. Zhang, H. Kosaki, K. Yanagi, S. Furuichi and K. Kuriyama. We show that the inequalities have a geometric interpretation in terms of quantum Fisher information. Using this formulation one may naturally ask if this family of inequalities can be further extendend, for example to the RLD quantum Fisher information. We show that this is impossible by producing a family of counterexamples.     

On spectral properties of periodic polyharmonic matrix operators

We consider a matrix operatorH = (-Δ)^l +V inR ⁿ, wheren ≥ 2,l ≥ 1, 4l > n + 1, andV is the operator of multiplication by a periodic inx matrixV(x). We study spectral properties ofH in the high energy region. Asymptotic formulae for Bloch eigenvalues and the corresponding spectral projections are constructed. The Bethe-Sommerfeld conjecture, stating that the spectrum ofH can have only a finite number of gaps, is proved.     

The weight twoK-theory of fields

We verify the weight-two portion of the Quillen-Lichtenbaum conjectures, relating the modn weight-twoK-groups of a field with the appropriate étale cohomology groups. This extends the work of Merkurjev and Suslin onK ₂ of a field, and the works of Suslin and the author on the indecomposableK ₃ of a field.Partially supported by the NSF.     

完全r部图乘积上的Graham猜想

图G的Pebbling数f(G)是最小的正整数n,使得不论n个Pebble如何放置在G的顶点上,总可以通过一系列的Pebbling移动把1个Pebble移到任意一点上,其中Pebbling移动是从一个顶点处移走两个Pebble而把其中一个移到与其相邻的一个顶点上。Graham猜测对于任意的连通图G和H有f(G×H)≤f(G)f(H)。本文证明对于一个完全r部图和一个具有2-Pebbleing性质的图来说,Graham猜想成立。作为一个推论,当G和H均为完全r部图时,Graham猜想成立。