一类含有P-Laplacian算子的奇异边值问题解的确切个数

讨论了一类p-L ap lac ian算子型的奇异边值问题正解的确切个数以及解的性质.     

An Additive Problem with Primes in Arithmetic Progressions

In this paper, we extend a classical result of Hua to arithmetic progressions with large moduli. The result implies the Linnik Theorem on the least prime in an arithmetic progression.     

A transform method for linear evolution PDEs on a finite interval

We study initial boundary value problems for linear scalar evolutionpartial differential equations, with spatial derivatives ofarbitrary order, posed on the domain {t > 0, 0 < x <L}. We show that the solution can be expressed as an integralin the complex k-plane. This integral is defined in terms ofan x-transform of the initial condition and a t-transform ofthe boundary conditions. The derivation of this integral representationrelies on the analysis of the global relation, which is an algebraicrelation defined in the complex k-plane coupling all boundaryvalues of the solution. For particular cases, such as the case of periodic boundaryconditions, or the case of boundary value problems for even-orderPDEs, it is possible to obtain directly from the global relationan alternative representation for the solution, in the formof an infinite series. We stress, however, that there existinitial boundary value problems for which the only representationis an integral which cannot be written as an infinite series.An example of such a problem is provided by the linearized versionof the KdV equation. Similarly, in general the solution of odd-orderlinear initial boundary value problems on a finite intervalcannot be expressed in terms of an infinite series.     

广义C-R组的性质及两个边值问题

本文考虑广义C-R组^[1](H)的解f=u iv jw∈C^2的一些性质，提出与之相关的两个边值问题，用积分方程方法和调和函数性质证明了边值问题解的存在唯一性，并写出解的积分表达式．     

Cauchy problems for linear thermoelastic systems of type III in one space variable

The goal of the paper is to analyse properties of solutions for linear thermoelastic systems of type III in one space variable. Our approach does not use energy methods, it bases on a special diagonalization procedure which is different in different parts of the phase space. This procedure allows to derive explicit representations of solutions. These representations help to prove results for well‐posedness of the Cauchy problem, L^P–L^q decay estimates on the conjugate line and results for propagation of singularities. Copyright © 2005 John Wiley & Sons, Ltd.     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

A remark on the Riemann‐Hilbert problem with a vanishing coefficient

This paper concerns the existence of nontrivial solutions of the Riemann‐Hilbert problem with a continuous coefficient whose values belong to two rays in the complex plane. Our results extend those recently obtained by E. Shargorodsky and J. F. Toland [6]. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Allocating electricity transmission costs through tracing: a game-theoretic rationale

Tracing is a method of assigning flows in an electricity network to particular generators and loads, assuming perfect mixing at each node. It can be used to assign costs to transmission users. We show that the resulting allocation is equal to the Shapley value of an equivalent co-operative game.     

A branch and bound algorithm for the robust shortest path problem with interval data

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.