锥上半连续锥拟凸集值映射多目标优化超有效解集的连通性

本文研究集值映射多目标优化超有效解集的连通性,在目标映射为锥上半连续和锥拟凸的条件下,证明了其超有效解集是连通的.     

Local dendrites with unique n-fold hyperspace

Let Z be a metric continuum and n be a positive integer. Let Cn(Z) be the hyperspace of the nonempty closed subsets of Z with at most n components. In this paper we prove the following result: Let X be a local dendrite such that every point of X has a neighborhood which is a dendrite whose set of end points is closed and Z is any continuum such that Cn(X) is homeomorphic to Cm(Z) for some n,m?3, then X is homeomorphic to Z.     

关于子基的局部连通性

在粗燥集理论研究中,覆盖方法的应用越来越受到重视,其中拓扑空间的子集关于子基的内部和闭包两个概念尤为重要.在最近由它们导入的关于子基的连通性基础上,给出了关于子基的局部连通性概念,并研究它的性质,得到一般拓扑学中局部连通性的一种推广.     

Uniformly locally connected uniform <Emphasis Type="Italic">σ</Emphasis>-frames

We introduce and study the concept of a uniformly locally connected uniform σ-frame. The uniformly locally connected reflection of a locally connected uniform σ-frame is constructed.      

On the simple connectedness of hyperplane complements in dual polar spaces, II

Suppose Δ is a dual polar space of rank n and H is a hyperplane of Δ. Cardinali, De Bruyn and Pasini have already shown that if n≥4 and the line size is greater than or equal to 4 then the hyperplane complement Δ−H is simply connected. This paper is a follow-up, where we investigate the remaining cases. We prove that the hyperplane complements are simply connected in all cases except for three specific types of hyperplane occurring in the smallest case, when the rank and the line size are both 3.     

L─Fuzzy拓扑空间的局部连通性

文［１］曾在广义拓扑分子格中提出了一种连通性。本文在Ｌ—ｆｕｚｚｙ拓扑空间中给出了这种连通性的几种刻划，并引入了Ｌ—ｆｙｚｚｙ拓扑空间的局部连通性。这种局部连通性是有限可乘的，商序同态保持的且是好的推广。另外，ｆｕｚｚｙ实直线是局部连通的。     

On General Plane Fronted Waves. Geodesics

A general class of Lorentzian metrics, , , with any Riemannian manifold, is introduced in order to generalize classical exact plane fronted waves. Here, we start a systematic study of their main geodesic properties: geodesic completeness, geodesic connectedness and multiplicity causal character of connecting geodesics. These results are independent of the possibility of a full integration of geodesic equations. Variational and geometrical techniques are applied systematically. In particular, we prove that the asymptotic behavior of H(x,u) with x at infinity determines many properties of geodesics. Essentially, a subquadratic growth of H ensures geodesic completeness and connectedness, while the critical situation appears when H(x,u) behaves in some direction as , as in the classical model of exact gravitational waves.     

Global Attractors: Topology and Finite-Dimensional Dynamics

Many dissipative evolution equations possess a global attractor with finite Hausdorff dimension d. In this paper it is shown that there is an embedding X of into , with N=[2d+2], such that X is the global attractor of some finite-dimensional system on with trivial dynamics on X. This allows the construction of a discrete dynamical system on which reproduces the dynamics of the time T map on and has an attractor within an arbitrarily small neighborhood of X. If the Hausdorff dimension is replaced by the fractal dimension, a similar construction can be shown to hold good even if one restricts to orthogonal projections rather than arbitrary embeddings.     

Connectedness structure of the solution sets of vector variational inequalities

By a scalarization method and properties of semi-algebraic sets, it is proved that both the Pareto solution set and the weak Pareto solution set of a vector variational inequality, where the constraint set is polyhedral convex and the basic operators are given by polynomial functions, have finitely many connected components. Consequences of the results for vector optimization problems are discussed in details. The results of this paper solve in the affirmative some open questions for the case of general problems without requiring monotonicity of the operators involved.     

Extremal Problems on Components and Loops in Graphs

The authors recently defined a new graph invariant denoted by Ω(G) only in terms of a given degree sequence which is also related to the Euler characteristic. It has many important combinatorial applications in graph theory and gives direct information compared to the better known Euler characteristic on the realizability, connectedness, cyclicness, components, chords, loops etc. Many similar classification problems can be solved by means of Ω. All graphs G so that Ω(G) ≤-4 are shown to be disconnected, and if Ω(G) ≥-2, then the graph is potentially connected. It is also shown that if the realization is a connected graph and Ω(G) =-2, then certainly the graph should be a tree.Similarly, it is shown that if the realization is a connected graph G and Ω(G) ≥ 0, then certainly the graph should be cyclic. Also, when Ω(G) ≤-4, the components of the disconnected graph could not all be cyclic and if all the components of G are cyclic, then Ω(G) ≥ 0. In this paper, we study an extremal problem regarding graphs. We find the maximum number of loops for three possible classes of graphs.We also state a result giving the maximum number of components amongst all possible realizations of a given degree sequence.