拟圆的最大-最小不等式性质

利用区域的最大-最小不等式性质的拟共形不变性和圆的最大-最小不等式性质,得到了拟圆的最大-最小不等式性质.     

Lip_J-扩张域和一致域(英文)

本文证明了如下两个结果:(1)域D(?)R~n是一致域当且仅当D是Lip_J-扩张域;(2)Jordan域D(?)R~2是拟圆当且仅当对在D上满足|f′(z)|≤d(z,(?)D)~(-1)的任意的解析函数f恒有f∈Lip_J(D),其中J(x_1,x_2)=1/2 log(1+|x_1-x_2|/d(x_1,(?)D))(1+|x_1-x_2|/d(x_2,(?)D)),x_1,x_2∈D.     

拟共形映射和弱Cigar域

设f是R~n到R~n上的同胚,本文证明了f是拟共形映射的充要条件是f将R~n中的任一弱Cigar域映成R~n中的弱Cigar域。     

强John域中的Lipschitz扩张和拟双曲度量

利用拟双曲度量刻划了强John域,并且获得了强John域中拟共形映射的Hardy-Littlewood性质.     

拟圆的三个充要条件

设D是(-R2)中的Jordan域,D*=(-R2)\(-D)是D的外部,本文证明了拟圆的下面三个充要条件(1)D是拟圆当且仅当D和D*都是弱拟凸域;(2)D是拟圆当且仅当D和D*都是弱Cigar域;(3)D是拟圆当且仅当D是弱一致域.     

拟圆的三个充要条件

设D是R2中的Jordan域,D*=R2＼D是D的外部,本文证明了拟圆的下面三个充要条件:(1)D是拟圆当且仅当D和D*都是弱拟凸域;(2)D是拟圆当且仅当D和D*都是弱Cigar域;(3)D是拟圆当且仅当D是弱一致域.     

距离边界条件域和H(o)lder域

主要利用了距离边界条件域和Holder域的定义,建立了当kD(x1,x2)和jD(x1,x2)满足一定的条件后,两类距离边界条件域和Holder域之间的四个充要条件和一个充分条件.     

距离边界条件域和Hǒlder域

主要利用了距离边界条件域和Hǒlder域的定义，建立了当kD（x1，x2）和jD（x1，x2）满足一定的条件后，两类距离边界条件域和Hǒlder域之间的四个充要条件和一个充分条件．     

距离Cigar域与拟共形映射

设f：R^n→R^n是一同胚，本文证明了f是拟共形映射的充要条件是f将R^n中的任一距离Cigar域映成R^n中的距离Cigar域．     

拟共形映射与John域

本证明了有界一致域必定是Hohn域和Jphn域的拟共不变性．     

有界星形域上的Poincaré不等式

本文得到了有界星形域上的Poincar啨不等式 ,证明了Poincar啨域在满足一定条件的拟共形映照下是不变的 .     

Max-min resource allocation

A problem is considered of the allocation of resources so as to maximize the minimum return from several activities. Optimality conditions are given for the case of a single resource, and are used to derive a solution algorithm. Problems with several resources cannot be solved by resourcewise optimization. Concave return functions are treated approximately by linear programming, and optimality or almost optimality of any feasible solution to such a problem can be evaluated by the solution of a linear programming problem. The evaluation measure is extended to certain feasible solutions of problems which have continuous, but not necessarily concave, return functions. A numerical example is given.     

一类四阶变分不等式的两子区域分裂法

本文基于一类四阶变分不等式的等价形式,讨论无重叠的两子区域分裂法,给出了方法的计算步骤,并得到了收敛性的结论。     

A Sobolev Extension Domain That is Not Uniform

In this paper we construct a Sobolev extension domain which, together with its complement, is topologically as nice as possible and yet not uniform. This shows that the well known implication that Uniform Sobolev extension cannot be reversed under strongest possible topological conditions.     

Max-min sum minimization transportation problem

A non-convex optimization problem involving minimization of the sum of max and min concave functions over a transportation polytope is studied in this paper. Based upon solving at most (g+1)(< p) cost minimizing transportation problems with m sources and n destinations, a polynomial time algorithm is proposed which minimizes the concave objective function where, p is the number of pairwise disjoint entries in the m× n time matrix {t _ij } sorted decreasingly and T ^g is the minimum value of the max concave function. An exact global minimizer is obtained in a finite number of iterations. A numerical illustration and computational experience on the proposed algorithm is also included. We are thankful to Prof. S. N. Kabadi, University of New Brunswick-Fredericton, Canada, who initiated us to the type of problem discussed in this paper. We are also thankful to Mr. Ankit Khandelwal, Ms. Neha Gupta and Ms. Anuradha Beniwal, who greatly helped us in the implementation of the proposed algorithm.     

Max-min weight balanced connected partition

For a connected graph $G=(V,E)$ and a positive integral vertex weight function $w$ , a max-min weight balanced connected $k$ -partition of $G$ , denoted as $BCP_k$ , is a partition of $V$ into $k$ disjoint vertex subsets $(V_1,V_2,\ldots ,V_k)$ such that each $G[V_i]$ (the subgraph of $G$ induced by $V_i$ ) is connected, and $\min _{1\le i\le k}\{w(V_i)\}$ is maximum. Such a problem has a lot of applications in image processing and clustering, and was proved to be NP-hard. In this paper, we study $BCP_k$ on a special class of graphs: trapezoid graphs whose maximum degree is bounded by a constant. A pseudo-polynomial time algorithm is given, based on which an FPTAS is obtained for $k=2,3,4$ . A step-stone for the analysis of the FPTAS depends on a lower bound for the optimal value of $BCP_k$ in terms of the total weight of the graph. In providing such a lower bound, a byproduct of this paper is that any 4-connected trapezoid graph on at least seven vertices has a 4-contractible edge, which may have a value in its own right.     

On Absolute Uniform Retracts,Uniform Approximation Property and Super Weakly Compact Sets of Banach Spaces

In this paper,we show that every super weakly compact convex subset of a Banach space is an absolute uniform retract,and that it also admits the uniform compact approximation property.These can be regarded as extensions of Lindenstrauss and Kalton's corresponding results.     

A Note on the Uniform Filling Property and Strong Irreducibility

Various separation properties of shift spaces have been defined in the literature. In Boyle et al. (Trans. Am. Math. Soc. 362:4617, 2010), several were put into a chain of strict implications, leaving one open question: Is the uniform filling property (UFP) a strictly weaker condition than strong irreducibility (SI)? We given an example to show that it is, and we show that UFP and SI are equivalent for two-dimensional square filling shifts of finite type.