半群作用Li-Yorke对的存在性

设X为紧度量空间,T为半群,本文研究了动力系统（X,T）上Li-Yorke对的存在性问题,证明了当（X,T）拓扑可迁且包含周期点时,在（X,T）上存在无限scrambled集.另外,列举了一些不包含Li-Yorke对的动力系统.     

A generalized version of Branner-Hubbard conjecture for rational functions

In 1992, Branner and Hubbard raised a conjecture that the Julia set of a polynomial is a Cantor set if and only if each critical component of its filled-in Julia set is not periodic. This conjecture was solved recently. In this paper, we generalize this result to a class of rational functions.     

Realizing enveloping algebras via varieties of modules

By using the Ringel-Hall algebra approach, we investigate the structure of the Lie algebra L（A） generated by indecomposable constructible sets in the varieties of modules for any finite- dimensional C-algebra A. We obtain a geometric realization of the universal enveloping algebra R（A） of L（A）, this generalizes the main result of Riedtmann. We also obtain Green＇s formula in a geometric form for any finite-dimensional C-algebra A and use it to give the comultiplication formula in R（A）.     

The pointwise dimensions of Moran measures

In this paper,we get the formulas of upper(lower) pointwise dimensions of some Moran measures on Moran sets in Rd under the strong separation condition.We also obtain formulas for the dimension of the Moran measures.Our results extend the known results of some self-similar measures and Moran measures studied by Cawley and Mauldin.     

A feasible SQP method for nonlinear programming

In this paper, a new SQP algorithm is presented to solve the general nonlinear programs with mixed equality and inequality constraints. Quoted from P. Spellucci (see [9]), this method maybe be named sequential equality constrained quadratic programming (SECQP) algorithm. Per single iteration, based on an active set strategy ( see [9]), this SECQP algorithm requires only to solve equality constrained quadratic programming subproblems or system of linear equations. The theoretical analysis shows that global and superlinear convergence can be induced under some suitable conditions.     

On a generalization of distance sets

A subset X in the d-dimensional Euclidean space is called a k-distance set if there are exactly k distinct distances between two distinct points in X and a subset X is called a locally k-distance set if for any point x in X, there are at most k distinct distances between x and other points in X.Delsarte, Goethals, and Seidel gave the Fisher type upper bound for the cardinalities of k-distance sets on a sphere in 1977. In the same way, we are able to give the same bound for locally k-distance sets on a sphere. In the first part of this paper, we prove that if X is a locally k-distance set attaining the Fisher type upper bound, then determining a weight function w, (X,w) is a tight weighted spherical 2k-design. This result implies that locally k-distance sets attaining the Fisher type upper bound are k-distance sets. In the second part, we give a new absolute bound for the cardinalities of k-distance sets on a sphere. This upper bound is useful for k-distance sets for which the linear programming bound is not applicable. In the third part, we discuss about locally two-distance sets in Euclidean spaces. We give an upper bound for the cardinalities of locally two-distance sets in Euclidean spaces. Moreover, we prove that the existence of a spherical two-distance set in (d−1)-space which attains the Fisher type upper bound is equivalent to the existence of a locally two-distance set but not a two-distance set in d-space with more than d(d+1)/2 points. We also classify optimal (largest possible) locally two-distance sets for dimensions less than eight. In addition, we determine the maximum cardinalities of locally two-distance sets on a sphere for dimensions less than forty.     

Graph operations that are good for greedoids

S is a local maximum stable set of a graph G, and we write S∈Ψ(G), if the set S is a maximum stable set of the subgraph induced by S∪N(S), where N(S) is the neighborhood of S. In Levit and Mandrescu (2002) [5] we have proved that Ψ(G) is a greedoid for every forest G. The cases of bipartite graphs and triangle-free graphs were analyzed in Levit and Mandrescu (2003) [6] and Levit and Mandrescu (2007) [7] respectively.In this paper we give necessary and sufficient conditions for Ψ(G) to form a greedoid, where G is:

(a)

the disjoint union of a family of graphs;

(b)

the Zykov sum of a family of graphs;

(c)

the corona X°{H₁,H₂,…,H_n} obtained by joining each vertex x of a graph X to all the vertices of a graph H_x.

     

On T-sequences and characterized subgroups

Let X be a compact metrizable abelian group and u={un} be a sequence in its dual group X^∧. Set su(X)={x:(un,x)→1} and . Let G be a subgroup of X. We prove that G=su(X) for some u iff it can be represented as some dually closed subgroup Gu of . In particular, su(X) is polishable. Let u={un} be a T-sequence. Denote by the group X^∧ equipped with the finest group topology in which un→0. It is proved that and . We also prove that the group generated by a Kronecker set cannot be characterized.     

Factorizing τ-spectra of mappings

In this paper by a spectrum of mappings we mean a morphism of spectra of spaces. However, using the notion of a mapping of mappings, we give the definition of a spectrum of mappings similar to that of a spectrum of spaces. In this case, the formulations of the given results are also similar to the formulations of the corresponding results concerning the spectra of spaces.For the spectra of mappings we define the notion of a τ-spectrum of mappings factorizing in a special sense and prove a version of the Spectral Theorem for such spectra. Furthermore, to a given indexed collection F of mapping we associate a τ-spectrum factorizing in the above special sense whose mappings are Containing Mappings for F constructed in Iliadis (2005) [4]. These associated τ-spectra and the corresponding version of the Spectral Theorem imply that for a given indexed collection F of mappings any so-called “natural” τ-spectrum for F factorizing in the special sense contains a cofinal and τ-closed subspectrum whose mappings are Containing Mapping for F. Thus, Containing Mappigs for F appear here without any concrete construction. The associated τ-spectra are used also in order to define and characterize the so-called second-type saturated classes of mappings (which are “saturated” by universal elements).     

Tree maps having chain movable fixed points

In this paper we discuss some basic properties of chain reachable sets and chain equivalent sets of continuous maps. It is proved that if f:T→T is a tree map which has a chain movable fixed point v, and the chain equivalent set CE(v,f) is not contained in the set P(f) of periodic points of f, then there exists a positive integer p not greater than the number of points in the set End([CE(v,f)])−Pv(f) such that fp is turbulent, and the topological entropy . This result generalizes the corresponding results given in Block and Coven (1986) [2], Guo et al. (2003) [6], Sun and Liu (2003) [10], Ye (2000) [11], Zhang and Zeng (2004) [12]. In addition, in this paper we also consider metric spaces which may not be trees but have open subsets U such that the closures are trees. Maps of such metric spaces which have chain movable fixed points are discussed.