Representation of the space of polyanalytic functions as a direct sum of orthogonal subspaces. Application to rational approximations

Suppose thatD={z:|z|<1}, L ₂ (D) is the space of functions square-integrable over area inD,A _k (D) is the set of allk-analytic functions inD, (A ₁ (D)=A(D) is the set of all analytic functions inD),A _k L ₂ (D)=L ₂ (D)∩A _k (D),A ₁ L ₂ (D)=AL ₂ (D),

复Clifford分析中的双曲调和函数

将多元复分析中一种复偏微分方程组的解与复Clifford分析中双曲调和函数联系起来,并研究了双曲调和函数的几个性质。     

Integrability of superharmonic functions, uniform domains, and Hölder domains

Let denote the space of all positive superharmonic functions on a domain . Lindqvist showed that is a bounded subset of . Using this, we give a characterization of finitely connected -dimensional uniform domains and remarks on Hölder domains.

     

Simple bounds for closed queueing networks

Consider a closed Jackson type network in which each queue has a single exponential server. Assume that N customers are moving among k queues. We establish simple closed form bounds on the network throughput (both lower and upper), which are sharper than those that are currently available. Numerical evaluation indicates that the improvements are significant.     

综合函数与扩展原理

本文首先对合情扩展映射的公理化条件的完备性与独立性进行讨论,之后给出了扩展原理的一般形式及合情扩展映射的等价定义。最后,利用综合函数,特别是变维综合函数列,给出了扩展原理的一些具体形式     

Pointwise Hardy inequalities

If is an open set with the sufficiently regular boundary, then the Hardy inequality holds for and , where . The main result of the paper is a pointwise inequality , where on the right hand side there is a kind of maximal function. The pointwise inequality combined with the Hardy-Littlewood maximal theorem implies the Hardy inequality. This generalizes some recent results of Lewis and Wannebo.

     

具有真细菌基因启动子活性的古生菌DNA片段

以大肠杆菌启动子探测质粒pKK232-8 为载体,用4 组限制性内切酶分别消化古生菌盐生盐杆菌R1(Halobacterium halobium )的染色体DNA,在体外进行重组,转化E.coliDH-5α感受态细胞,得到12 个转化子(T1～T12),其抗性水平分布在10～500 m g/L的区间内. 将这些转化子所含质粒分别命名为pSX1～pSX12,限制性酶切分析表明,这些质粒各插入了一段不同的外源DNA 片段,杂交分析表明,抗性最强的转化子T11 所含质粒pSX11 上插入了一段来源于盐生盐杆菌R1 染色体的DNA 片段. 该DNA 片段在大肠杆菌中具有启动子功能.     

Hypergeometric Polynomials and Integer Programming

We examine connections between A-hypergeometric differential equations and the theory of integer programming. In the first part, we develop a hypergeometric sensitivity analysis for small variations of constraint constants with creation operators and b-functions. In the second part, we study the indicial polynomial (b-function) along the hyperplane xi=0 via a correspondence between the optimal value of an integer programming problem and the roots of the indicial polynomial. Gröbner bases are used to prove theorems and give counter examples.     

Existence and Limiting Behavior of Trajectories Associated with P0-equations

Given a continuous P₀-function F : Rⁿ Rⁿ, we describe a method of constructing trajectories associated with the P₀-equation F(x) = 0. Various well known equation-based reformulations of the nonlinear complementarity problem and the box variational inequality problem corresponding to a continuous P₀-function lead to P₀-equations. In particular, reformulations via (a) the Fischer function for the NCP, (b) the min function for the NCP, (c) the fixed point map for a BVI, and (d) the normal map for a BVI give raise to P₀-equations when the underlying function is P₀. To generate the trajectories, we perturb the given P₀-function F to a P-function F(x, ); unique solutions of F(x, ) = 0 as varies over an interval in (0, ) then define the trajectory. We prove general results on the existence and limiting behavior of such trajectories. As special cases we study the interior point trajectory, trajectories based on the fixed point map of a BVI, trajectories based on the normal map of a BVI, and a trajectory based on the aggregate function of a vertical nonlinear complementarity problem.     

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems

In this paper we describe a Newton-type algorithm model for solving smooth constrained optimization problems with nonlinear objective function, general linear constraints and bounded variables. The algorithm model is based on the definition of a continuously differentiable exact merit function that follows an exact penalty approach for the box constraints and an exact augmented Lagrangian approach for the general linear constraints. Under very mild assumptions and without requiring the strict complementarity assumption, the algorithm model produces a sequence of pairs converging quadratically to a pair where satisfies the first order necessary conditions and is a KKT multipliers vector associated to the linear constraints. As regards the behaviour of the sequence x ^k alone, it is guaranteed that it converges at least superlinearly. At each iteration, the algorithm requires only the solution of a linear system that can be performed by means of conjugate gradient methods. Numerical experiments and comparison are reported.