Cn中不同域的复合算子

令Ω1与Ω2与C^n中的两个有界齐性域，假设φ：1Ω→Ω2是一个全纯映射。在本中，我们研究相应的复合算子Cφ：β（Ω2）→β（Ω1）的有界性和紧性，特别地，我们讨论取B^n和U^n的情形。     

A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

The rank of Hankel operators on harmonic Bergman spaces

We show that on the harmonic Bergman spaces, the Hankel operators with nonconstant harmonic symbol cannot be of finite rank.

     

中国邮路问题的一个解法

本给出中国邮路问题的一个解法。虽然它仍只是初始方案，但因考虑了问题的足够信息，因而这种方案至少拉近了与最优解的距离。     

一种基于图论与熵的专家判断客观可信度的确定方法

本文给出一种群决策中确定专家判断可信度的方法，其主要思路是首先通过图论中最小生成树的方法提取专家判断矩阵的全部信息，其次，使用相对熵指标确定获得专家判断的最终结果，并同时衡量专家自身判断的统一程度，从而确定专家判断的相对客观可信度。最后，文章给出一个典型的算例以说明该方法的可行性和有效性。     

The canonical solution operator of $ {\bar \partial } $ on weighted spaces with holomorphic coefficients

On weighted spaces with strictly plurisubharmonic weightfunctions the canonical solution operator of and the ‐Neumann operator are bounded. In this paper we find a class of strictly plurisubharmonic weightfunctions with certain growth conditions, so that they are Hilbert‐Schmidt operators between weighted spaces with different weightfunctions, if they are restricted to forms with holomorphic coefficients. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.