Coincidence theorems and minimax theorems

In the present paper a few coincidence theorems and minimax theorems are given so as to unify and strengthen the corresponding results in [3], [4] and [5].The Project Supported by National Natural Science Foundation of China.     

Coincidence theorems and minimax theorems (II)

A coincidence theorem for a single-valued mapping in [3] is generalized as one for a strongly decomposable multivalued mapping. Project supported by the National Natural Science Foundation of China     

Tauberian theorems

Tauberian constants and estimates are calculated for the difference of two linear transforms from the form (1.1) of the same function satisfying Tauberian conditions. Applications for number-sequences, and connections with previous results are shown.     

Decomposition theorems

The countable-decomposition theorem for linear functionals has become a useful tool in the theory of representing measures (see [4–7]). The original proof of this theorem was based on a rather involved study of extreme points in the state space of a convex cone. Recently M. Neumann [9] gave an independent proof using a refined form of Simons convergence lemma and Choquet's theorem. In this paper a (relatively) short proof of an extension (to a more abstract situation) of the countable-decomposition theorem is given. Furthermore a decomposition criterion is obtained which even works in the case when not all states are decomposable. All the work is based on a complete characterization of those states which are partially decomposable with respect to a given sequence of sublinear functionals.     

Generalized KKM theorems and common fixed point theorems

In this paper, we first prove a generalized KKM theorem, and then use this generalized KKM theorem to establish the generalized equi-KKM theorem, common fixed point theorems for a family of multivalued maps, and the Kakutani-Fan-Glicksberg fixed point theorem. We also show that an existence theorem of the common fixed point theorem is equivalent to the Kakutani-Fan-Glicksberg fixed point theorem.     

Separation theorems and minimax theorems for fuzzy sets

In this paper, we prove some theorems on fuzzy sets. We first show that, in order to demonstrate that the equality of shadows ofA andB implies the equality ofA andB, it is necessary to assume thatA andB are closed and thatS _H (A)=S _H (B) for any closed hyperplane hyperplaneH. We also obtain a separation theorem for two convex fuzzy sets in a Hilbert space. Finally, we investigate results relating to minimax theorems for fuzzy sets. We obtain a necessary and sufficient condition for compactness.The authors wish to express their sincere thanks to Professor Hisaharu Umegaki for his invaluable suggestions and advice.     

Three-circles theorems

Journal d'Analyse Mathématique -     

Multiplier theorems

We state and prove a multiplier theorem for a central element A of ZG, the group ring over Z of a group G. This generalizes most previously known multiplier theorems for difference sets and divisible difference sets. We also provide applications to show that our theorem provides new multipliers and establish the nonexistence of a family of divisible difference sets which correspond to elliptic semiplanes admitting a regular collineation group. © 1995 John Wiley & Sons, Inc.     

Comparison theorems and existence theorems for ordinary differential equations

We are concerned with uniqueness and existence theorems for two point boundary value problems for the nonlinear differential equation Ly = f(x, y), where L is the classical nth order linear differential operator. In proving our results interesting comparison theorems are proven for linear differential equations.     

On Ambarzumyan-type theorems

Generalizations of the classical Ambarzumyan theorem are provided for wide classes of self-adjoint differential operators with arbitrary self-adjoint boundary conditions: scalar Sturm–Liouville operators, higher-order differential operators, matrix Sturm–Liouville operators and operators on spatial networks.     

关于极小极大原理

通过减弱条件,获得了一个新的结果。由此,我们给出一些新的极小极大定理和极小极大不等式。     

Induced Ramsey-type theorems

We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rödl, Łuczak-Rödl, Prömel-Rödl, Erdős-Hajnal, and Nikiforov. The proofs are based on a simple lemma (generalizing one by Graham, Rödl, and Ruciński) that can be used as a replacement for Szemerédi's regularity lemma, thereby giving much better bounds. The same approach can be also used to show that pseudo-random graphs have strong induced Ramsey properties. This leads to explicit constructions for upper bounds on various induced Ramsey numbers.