EXISTENCE AND UNIQUENESS OF GLOBAL SOLUTION FOR CERTAIN NONLINEAR DEGENERATE PARABOLIC SYSTEMS

ＥＸＩＳＴＥＮＣＥＡＮＤＵＮＩＱＵＥＮＥＳＳＯＦＧＬＯＢＡＬＳＯＬＵＴＩＯＮＦＯＲＣＥＲＴＡＩＮＮＯＮＬＩＮＥＡＲＤＥＧＥＮＥＲＡＴＥＰＡＲＡＢＯＬＩＣ　ＳＹＳＴＥＭＳＬＵＧＵＯＦＵ（卢国富）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｐｕｔｉ...     

A modified Frank-Wolfe algorithm and its convergence properties

ＡＭＯＤＩＦＩＥＤＦＲＡＮＫ－ＷＯＬＦＥＡＬＧＯＲＩＴＨＭＡＮＤＩＴＳＣＯＮＶＥＲＧＥＮＣＥＰＲＯＰＥＲＴＩＥＳＷＵＦＡＮＧ（吴方）ＷＵＳＨＩＱＵＡＮ（吴士泉）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ,ｔｈｅＣｈｉｎｅｓｅＡｃａｄ...     

ON GLOBAL SOLUTION FOR A CLASS OF SYSTEMS OF MULTI－DIMENSIONAL GENERALIZED ZAKHAROV TYPE EQUATION

ＯＮＧＬＯＢＡＬＳＯＬＵＴＩＯＮＦＯＲＡＣＬＡＳＳＯＦＳＹＳＴＥＭＳＯＦＭＵＬＴＩ－ＤＩＭＥＮＳＩＯＮＡＬＧＥＮＥＲＡＬＩＺＥＤＺＡＫＨＡＲＯＶＴＹＰＥＥＱＵＡＴＩＯＮＧＵＯＢＯＬＩＮＧ（郭柏灵）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄａｎｄＣｏｍｐｕ...     

A singularly perturbed second order quasilinear BVP

ＡＳＩＮＧＵＬＡＲＬＹＰＥＲＴＵＲＢＥＤＳＥＣＯＮＤＯＲＤＥＲＱＵＡＳＩＬＩＮＥＡＲＢＶＰＬＩＮＷＵＺＨＯＮＧ（林武忠）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ,ＥａｓｔＣｈｉｎａＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ,Ｓｈａｎｇｈａｉ２０００６２...     

ADMISSIBILITY OF LINEAR ESTIMATE OF REGRESSION COEFFICIENTS IN GROWTH CURVE MODEL UNDER MATRIX LOSS

ＡＤＭＩＳＳＩＢＩＬＩＴＹＯＦＬＩＮＥＡＲＥＳＴＩＭＡＴＥＯＦＲＥＧＲＥＳＳＩＯＮＣＯＥＦＦＩＣＩＥＮＴＳＩＮＧＲＯＷＴＨＣＵＲＶＥＭＯＤＥＬＵＮＤＥＲＭＡＴＲＩＸＬＯＳＳＷＡＮＧＸＵＥＲＥＮ（王学仁）（ＤｅｐａｒｔｍｅｎｔｏｆＳｔａｔｉｓｔｉｃｓ，...     

TURNING POINT PROBLEMS FOR THE THIRD ORDER DIFFERENTIAL EQUATIONS EXHIBITING RESONANCE

ＴＵＲＮＩＮＧＰＯＩＮＴＰＲＯＢＬＥＭＳＦＯＲＴＨＥＴＨＩＲＤＯＲＤＥＲＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳＥＸＨＩＢＩＴＩＮＧＲＥＳＯＮＡＮＣＥＸＩＡＯＣＨＥＮＧＹＯＵ（肖成猷）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＥａｓｔＣｈｉ...     

BOUNDARY LAYER ESTIMATION OF A SINGULAR PROBLEM WITH LIMIT EQUATION OF ORDER 2

ＢＯＵＮＤＡＲＹＬＡＹＥＲＥＳＴＩＭＡＴＩＯＮＯＦＡＳＩＮＧＵＬＡＲＰＲＯＢＬＥＭＷＩＴＨＬＩＭＩＴＥＱＵＡＴＩＯＮＯＦＯＲＤＥＲ２ＨＥＣＨＥＮＧ（何成）ＺＨＡＮＧＷＥＩＴＡＯ（张维弢）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ，Ｃｈｉｎｅ...     

CLIFFORD MARTINGALES Φ-EQUIVALENCE BETWEEN S（f） AND f^＊

ＣＬＩＦＦＯＲＤＭＡＲＴＩＮＧＡＬＥＳΦ－ＥＱＵＩＶＡＬＥＮＣＥＢＥＴＷＥＥＮＳ（ｆ）ＡＮＤｆ￥ＬＯＮＧＲＵＬＩＮ；ＱＩＡＮＴＡＯ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＡｃａｄｅｍｉａＳｉｎｉｃａ，Ｂｅｉｊｉｎｇ１０００８０，Ｃｈｉｎａ．）...     

NECESSARY AND SUFFICIENT CONDITION FOR OSCILLATION OF A CLASS OF HIGHERORDER NEUTRAL EQUATIONS

ＮＥＣＥＳＳＡＲＹＡＮＤＳＵＦＦＩＣＩＥＮＴＣＯＮＤＩＴＩＯＮＦＯＲＯＳＣＩＬＬＡＴＩＯＮＯＦＡＣＬＡＳＳＯＦＨＩＧＨＥＲＯＲＤＥＲＮＥＵＴＲＡＬＥＱＵＡＴＩＯＮＳＬｉｎＹｉｚｈｏｎｇ（林宜中）（ＦｕｊｉａｎＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，福建师范...     

LOCAL TOPOLOGICAL STRUCTURE OF THE PLANE CUBIC SYSTEM IN THE UNDETERMINED SIGN CASE

（李学敏）（杨殿武）ＬＯＣＡＬＴＯＰＯＬＯＧＩＣＡＬＳＴＲＵＣＴＵＲＥＯＦＴＨＥＰＬＡＮＥＣＵＢＩＣＳＹＳＴＥＭＩＮＴＨＥＵＮＤＥＴＥＲＭＩＮＥＤＳＩＧＮＣＡＳＥ￥ＬｉＸｕｅｍｉｎ；ＹａｎｇＤｉａｎｗｕ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ...     

Review of recent results about theκ-centrum of a tree

This paper is concerned with the-centrum of a graph. This concept, related to a particular location problem, generalizes that of the center and that of the median of a graph: the-centrum is the set of points for which the sum of the (weighted) distances from the farthest vertices is minimized. The paper will review some recent results about this problem. In particular, some properties of cardinality, connectivity and, more generally, of the structure of the-centrum of a weighted tree will be presented.     

Precoloring extension on unit interval graphs

In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 35-56], we show that the precoloring extension problem is NP-complete on unit interval graphs.     

On Crown-Free Graphs with Regular μ-Subgraphs,II

The crown is the complete multipartite graph K _1,1,3. Terwilliger graphs without crowns and graphs without 3-cocliques with regular -subgraphs of given positive degree are studied. As a corollary, the local structure of graphs in which the neighborhoods of vertices are regular Terwilliger graphs of diameter 2 and some of these neighborhoods contain no 7-paws is determined. Connected crown-free graphs in which -subgraphs are edge regular graphs of diameter not exceeding 2 with given parameters are described.     

Extensions and consequences of Chvátal-Erdős' theorem

A classical result of Chvátal and Erds states that a graph with independence number smaller or equal to its connectivity contains a Hamilton cycle. In this note we discuss some extensions of this theorem and show how they can be used to proof several other results in hamiltonian graph theory. Although several of the results are known, the proofs in this note are in general essentially shorter than the original proofs, and also give an indication of the relations between the results.Supported by a grant from the Natural Sciences and Engineering Research Council of Canada     

On paraconvexity of graphs of continuous functions

The concept of paraconvexity of a subsetP E of a normed spaceE was first introduced by E. Michael. Roughly speaking, it consists of a controlled weakening of the convexity assumption forP, where the control is guaranteed via some parameter [0, 1). In this paper, we consider the case whenP is a subset of some (n+1)-dimensional Euclidean spaceE andP is the graph of some continuous functionf:V , whereV E is some convexn-dimensional subset ofE. Our key result is that paraconvexity of such a setP follows from the paraconvexity of sections ofP by two-dimensional planes, orthogonal toV. As an application, we prove a selection theorem for graph-valued mappings whose values have Lipschitzian (with a fixed constant) or monotone two-dimensional sections.Supported in part by the Ministry of Science and Technology of the Republic of Slovenia Research Grant No. P1-0214-101-93.Supported in part by G. Soros International Science Foundation.     

Equilibrium States of Random Economies with Locally Interacting Agents and Solutions to Stochastic Variational Inequalities in 〈L1,L∞〉

We study a stochastic model of an economy with locally interacting agents. The basis of the study is a deterministic model of dynamic economic equilibrium proposed by Polterovich. We generalize Polterovich's theory, in particular, in two respects. We introduce stochastics and consider a version of the model with local interactions between the agents. The structure of the interactions is described in terms of random fields on a directed graph. Equilibrium states of the system are solutions to certain variational inequalities in spaces of random vectors. By analyzing these inequalities, we establish an existence theorem for equilibrium, which generalizes and refines a number of previous results.     

ℓ1-Rigid Graphs

An ₁-graph is a graph whose nodes can be labeled by binary vectors in such a way that the Hamming distance between the binary addresses is, up to scale, the distance in the graph between the corresponding nodes. We show that many interesting graphs are ₁-rigid, i.e., that they admit an essentially unique such binary labeling.     

Some properties for a class of interchange graphs

The Wiener number is the sum of distances between all pairs of vertices of a connected graph. In this paper, we give an explicit algebraic formula for the Wiener number of a class of interchange graphs. Moreover, distance-related properties and cliques of this class of interchange graphs are investigated.     

\mathcal{Q}-Universal Quasivarieties of Graphs

It is proved that a quasivariety K of undirected graphs without loops is -universal if and only if K contains some non-bipartite graph.     

On the Total Domination Number of Cartesian Products of Graphs

The most famous open problem involving domination in graphs is Vizings conjecture which states the domination number of the Cartesian product of any two graphs is at least as large as the product of their domination numbers. In this paper, we investigate a similar problem for total domination. In particular, we prove that the product of the total domination numbers of any nontrivial tree and any graph without isolated vertices is at most twice the total domination number of their Cartesian product, and we characterize the extremal graphs.Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal