On Chebyshev functions and Klee functions

Associated to a lower semicontinuous function, one can define its proximal mapping and farthest mapping. The function is called Chebyshev (Klee) if its proximal mapping (farthest mapping) is single-valued everywhere. We show that the function f is 1/λ-hypoconvex if its proximal mapping Pλf is single-valued. When the function f is bounded below, and Pλf is single-valued for every λ>0, the function must be convex. Similarly, we show that the function f is 1/μ-strongly convex if the farthest mapping Qμf is single-valued. When the function is the indicator function of a set, this recovers the well-known Chebyshev problem and Klee problem in Rn. We also give an example illustrating that a continuous proximal mapping (farthest mapping) needs not be locally Lipschitz, which answers one open question by Hare and Poliquin.     

交换环上的严格上三角代数上的双导子

Let Nn（R）be the algebra consisting of all strictly upper triangular n × n matrices over a commutative ring R with the identity.An R-bilinear map φ ：Nn（R）×Nn（R）→ Nn（R）is called a biderivation if it is a derivation with respect to both arguments.In this paper,we define the notions of central biderivation and extremal biderivation of Nn（R）,and prove that any biderivation of Nn（R）can be decomposed as a sum of an inner biderivation,central biderivation and extremal biderivation for n ≥ 5.     

Bounds and Constructions for Two‐Dimensional Variable‐Weight Optical Orthogonal Codes

Optical orthogonal codes (1D constant‐weight OOCs or 1D CWOOCs) were first introduced by Salehi as signature sequences to facilitate multiple access in optical fibre networks. In fiber optic communications, a principal drawback of 1D CWOOCs is that large bandwidth expansion is required if a big number of codewords is needed. To overcome this problem, a two‐dimensional (2D) (constant‐weight) coding was introduced. Many optimal 2D CWOOCs were obtained recently. A 2D CWOOC can only support a single QoS (quality of service) class. A 2D variable‐weight OOC (2D VWOOC) was introduced to meet multiple QoS requirements. A 2D VWOOC is a set of 0, 1 matrices with variable weight, good auto, and cross‐correlations. Little is known on the construction of optimal 2D VWOOCs. In this paper, new upper bound on the size of a 2D VWOOC is obtained, and several new infinite classes of optimal 2D VWOOCs are obtained.     

L~2(R~n)上的半正交多小波框架

本文研究L2(Rn)上伸缩矩阵A满足|detA|1的半正交多小波框架.本文得到半正交和严格半正交框架的一系列性质及刻画.本文证明半正交Parseval多小波框架与广义多分辨分析(GMRA)Parseval多小波框架是等价的.特别地,本文利用最小频率支撑(MSF)多小波框架和小波集,构造若干半正交多小波框架的例子.     

最优(m,n,4,1)光正交签名码的进一步结果

为支持高速多址网络中二维图像的传输,Kitayama首次提出码分多址并行图像传输系统的概念.作为码分多址并行图像传输系统的首选光地址码,光正交签名码(OOSPC)是一族具有良好相关性的Hamming重量为k的m×n(0,1)-矩阵.用Θ(m,n,k,λ)表示所有参数为(m,n,k,λ)的OOSPC中码字容量可能的最大值,则称码字容量为Θ(m,n,k,λ)的(m,n,k,λ)-OOSPC是最优的.本文将针对满足下列条件之一的正整数m和n:(1)mn≡8,16(mod 24),gcd(m,n,2)=2,且mn≡16(mod 32)和gcd(m,n,4)=2不同时成立,其中m和n的所有奇素因子均模6余1;(2)mn≡0(mod 24)且gcd(m,n,6)=2,证明Θ(m,n,4,1)=|mn-1/12|,即构造码字容量为|mn-1/12|的最优(m,n,4,1)-OOSPC.     

拓扑空间中锥拟凸映射多目标优化问题有效解集的连通性

本文研究拓扑空间中锥拟凸多目标优化问题的有效解集的连通性．在目标映射是上连续和拟凸(次严格拟凸)的条件下，证明了锥弱有效(有效)解集是连通的.进一步，在是连续和强拟凸的条件下，证明了锥有效解集是路连通的.     

On the invariant faces associated with a cone-preserving map

For an nonnegative matrix , an isomorphism is obtained between the lattice of initial subsets (of ) for and the lattice of -invariant faces of the nonnegative orthant . Motivated by this isomorphism, we generalize some of the known combinatorial spectral results on a nonnegative matrix that are given in terms of its classes to results for a cone-preserving map on a polyhedral cone, formulated in terms of its invariant faces. In particular, we obtain the following extension of the famous Rothblum index theorem for a nonnegative matrix: If leaves invariant a polyhedral cone , then for each distinguished eigenvalue of for , there is a chain of distinct -invariant join-irreducible faces of , each containing in its relative interior a generalized eigenvector of corresponding to (referred to as semi-distinguished -invariant faces associated with ), where is the maximal order of distinguished generalized eigenvectors of corresponding to , but there is no such chain with more than members. We introduce the important new concepts of semi-distinguished -invariant faces, and of spectral pairs of faces associated with a cone-preserving map, and obtain several properties of a cone-preserving map that mostly involve these two concepts, when the underlying cone is polyhedral, perfect, or strictly convex and/or smooth, or is the cone of all real polynomials of degree not exceeding that are nonnegative on a closed interval. Plentiful illustrative examples are provided. Some open problems are posed at the end.

     

Mechanism of the formation of singularities for quasilinear hyperbolic systems with linearly degenerate characteristic fields

One often believes that there is no shock formation for the Cauchy problem of quasilinear hyperbolic systems (of conservation laws) with linearly degenerate characteristic fields. It has been a conjecture for a long time (see Arch. Rational Mech. Anal. 2004; 172 :65–91; Compressible Fluid Flow and Systems of Conservation Laws in Several Space Variables. Springer: New York, 1984) and it is still an open problem in the general situation up to now. In this paper, a framework to justify this conjecture is proposed, and, by means of the concept such as the strict block hyperbolicity, the part richness and the successively block‐closed system, some general kinds of quasilinear hyperbolic systems, which verify the conjecture, are given. Copyright © 2007 John Wiley & Sons, Ltd.     

Contractibility of the Solution Sets in Strictly Quasiconcave Vector Maximization on Noncompact Domains

We study the contractibility of the efficient solution set of strictly quasiconcave vector maximization problems on (possibly) noncompact feasible domains. It is proved that the efficient solution set is contractible if at least one of the objective functions is strongly quasiconcave and any intersection of level sets of the objective functions is a compact (possibly empty) set. This theorem generalizes the main result of Benoist (Ref.1), which was established for problems on compact feasible domains.The authors thank Dr. T. D. Phuong, Dr. T. X. D. Ha, and the referees for helpful comments and suggestions.