Boundary interpolation in the ball

We solve a boundary interpolation problem in the reproducing kernel Hilbert space of functions analytic in the unit ball of with reproducing kernel 1/(1−∑₁^Nz_kw_k^*). We introduce the notion of Brune factor (or Blaschke–Potapov factor of the third kind) in this setting.     

两种不同系统因素影响下完全检验的最优设计

本文研究了两种不同系统因素影响下完全检验的质量最优问题 ,采用有两种不同控制界限的控制图来控制生产过程 ,并根据完全检验的特点 ,提出了一种新的最优模型。 Hui(1 991 )提出的最优模型是本文的最优模型的特殊情况 ,并且本文建立的最优模型还可推广到两种以上不同的系统因素下影响的情况     

Some applications of L2-hedging with a non-negative wealth process

We consider the problem of L ²-hedging of contingent claims in diffusion type models for securities markets. In contrast to a recent paper of Schweizer (1994) we insist on a non-negative wealth process corresponding to the optimal hedge portfolio. For this reason the usual projection methods cannot be applied. We give some applications of L ²-hedging in this setting including hedging under constraints, a problem of approximating the wealth process of a richer investor and a mean-variance version of it.     

Common fixed point theorems for non-self-mappings in metric spaces of hyperbolic type

In this paper, the concept of a pair of non-linear contraction type mappings in a metric space of hyperbolic type is introduced and the conditions guaranteeing the existence of a common fixed point for such non-linear contractions are established. Presented results generalize and improve some of the known results. An example is constructed to show that our theorems are genuine generalizations of the main theorems of Assad, ?iri?, Khan et al., Rhoades and Imdad and Kumar. One of the possible applications of our results is also presented.     

Optimal Sequencing of Inspection of Dependent Characteristics

We address the problem of sequentially inspecting the dependent characteristics of a product, where the dependency is expressed in terms of the joint probabilities of the fitness of the characteristics. We show that, even when the inspection has classification errors, the joint probability mass function of the observed fitness of the characteristics is independent of the sequence of inspection. Using this result, a dynamic programming approach is presented for finding the optimal sequence that minimizes the expected total cost of inspection. Previously reported policies for independent characteristics are shown to be special cases of the results presented here.     

A note on total colourings of digraphs

In the paper two different arc-colourings and two associated with the total colourings of digraphs are considered. In one of these colourings we show that the problem of calculating the total chromatic index reduces to that of calculating the chromatic number of the underlying graph. In the other colouring we find the total chromatic indices of complete symmetric digraphs and tournaments.     

On the Maximum Number of Cliques in a Graph

A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-degenerate graphs with n vertices and m edges; (4) planar graphs with n vertices and m edges; and (5) graphs with n vertices and no K₅-minor or no K_3,3-minor. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2). Research supported by a Marie Curie Fellowship of the European Community under contract 023865, and by the projects MCYT-FEDER BFM2003-00368 and Gen. Cat 2001SGR00224.     

可加广义代数格上的 Tietze 扩张定理

可加的广义代数格范畴与 T₀ 拓扑空间范畴相等价, 从这个观点出发, 作者把可加广义代数格作为一个闭集格, 在其上建立 Urysohn 引理和 Tietze 扩张定理. 这是拓扑理论在格上的一种新推广, 有助于格上拓扑理论的研究和广义连续格理论的应用.     

对于轮和完全图的 Ramsey 数的渐近上界

该文给出:对于偶数m≥4当n→ ∞时 r(W_m,K_n)≤l(1+o(1))C₁(m) (n/logn ) ^(2m-2)/(m-2)对于奇数m≥5当n→∞时r(W_m,K_n)≤(1+o(1))C₂(m) (n^2m/_m+1/^{_{log n)}(m+1)/(m-1)} .特别地,C₂(5)=12. 以及 c(ⁿ/_logn)^5/2≤r(K₄,K_n)≤ (1+o(1)) ^n3_/(logn)².此外,该文还讨论了轮和完全图的 Ramsey 数的一些推广.