Structure of Degenerate Block Algebras

Given a non-trivial torsion-free abelian group (A,+,Q), a field F of characteristic 0, and a non-degenerate bi-additive skew-symmetric map : A A F, we define a Lie algebra = (A, ) over F with basis {e_x | x A/{0}} and Lie product [e_x,e_y] = (x,y)e_x+y. We show that is endowed uniquely with a non-degenerate symmetric invariant bilinear form and the derivation algebra Der of is a complete Lie algebra. We describe the double extension D( , T) of by T, where T is spanned by the locally finite derivations of , and determine the second cohomology group H²(D( , T),F) using anti-derivations related to the form on D( , T). Finally, we compute the second Leibniz cohomology groups HL²( , F) and HL²(D( , T), F).2000 Mathematics Subject Classification: 17B05, 17B30This work was supported by the NNSF of China (19971044), the Doctoral Programme Foundation of Institution of Higher Education (97005511), and the Foundation of Jiangsu Educational Committee.     

Small Solutions of Quadratic Diophantine Equations

We consider quadratic diophantine equations of the shape for a polynomial Q(X₁, ..., X_s) Z[X₁, ..., X_s] of degree 2.Let H be an upper bound for the absolute values of the coefficientsof Q, and assume that the homogeneous quadratic part of Q isnon-singular. We prove, for all s 3, the existence of a polynomialbound _s(H) with the following property: if equation (1) hasa solution x Z^s at all, then it has one satisfying For s = 3 and s = 4 no polynomial bounds _s(H) were previouslyknown, and for s 5 we have been able to improve existing boundsquite significantly. 2000 Mathematics Subject Classification11D09, 11E20, 11H06, 11P55.     

Orders on Braid Groups

It is shown that the braid group defies lattice ordering.     

Stabilizability in Asymptotically Finite-Dimensional Semigroups

We study a semigroup of linear operators on a Banach space X which satisfies the condition codim X ₀<, where We show that X ₀ is closed and establish some properties of the asymptotic behavior of the subspaces complementing X ₀ to X.     

An Open Question on Cyclic Relaxation

The problem discussed in this note is highly interesting. It is related to several dual iterative methods, such as the methods proposed by Kaczmarz, Hildreth, Agmon, Cryer, Mangasarian, Herman, Lent, Censor, and others. Cast as row-action methods these algorithms have been proved as useful tools for solving large convex feasibility problems that arise in medical image reconstruction from projections, in inverse problems in radiation therapy, and in linear programming.The question that we want to answer is how these algorithms behave when the feasible region is empty. It is shown that under certain conditions the primal sequence still converges while the dual sequence {y _k } obeys the rule y _k =u _k +k v, where {u _k } is a converging sequence and v is a fixed vector that satisfies A ^T v=0,v0,and,b ^T v>0. It is conjectured that these properties hold whenever the feasible region is empty. However, the validity of this claim remains an open question.This revised version was published online in October 2005 with corrections to the Cover Date.     

The numerical approximation of center manifolds in Hamiltonian systems

In this paper we develop a numerical method for computing higher order local approximations of center manifolds near steady states in Hamiltonian systems. The underlying system is assumed to be large in the sense that a large sparse Jacobian at the equilibrium occurs, for which only a linear solver and a low-dimensional invariant subspace is available. Our method combines this restriction from linear algebra with the requirement that the center manifold is parametrized by a symplectic mapping and that the reduced equation preserves the Hamiltonian form. Our approach can be considered as a special adaptation of a general method from Numer. Math. 80 (1998) 1-38 to the Hamiltonian case such that approximations of the reduced Hamiltonian are obtained simultaneously. As an application we treat a finite difference system for an elliptic problem on an infinite strip.     

Empirical likelihood for partial linear models

In this paper the empirical likelihood method due to Owen (1988,Biometrika,75, 237–249) is applied to partial linear random models. A nonparametric version of Wilks' theorem is derived. The theorem is then used to construct confidence regions of the parameter vector in the partial linear models, which has correct asymptotic coverage. A simulation study is conducted to compare the empirical likelihood and normal approximation based method. Research supported by NNSF of China and a grant to the first author for his excellent Ph.D. dissertation work in China. Research supported by Hong Kong RGC CERG No. HKUST6162/97P.     

Galerkin Approximations for the Linear Parabolic Equation with the Third Boundary Condition

We solve a linear parabolic equation in ^d , d 1, with the third nonhomogeneous boundary condition using the finite element method for discretization in space, and the -method for discretization in time. The convergence of both, the semidiscrete approximations and the fully discretized ones, is analysed. The proofs are based on a generalization of the idea of the elliptic projection. The rate of convergence is derived also for variable time step-sizes.     

A New Technique for Ill-Conditioned Linear Systems

The technique we propose for solving ill-conditioned linear systems consists of two steps. First we compute the regularized solution on some values of the regularization parameter . Then we use these solutions either to extrapolate at =0 or to estimate the regularized solution with determined by the generalized cross validation or by the L-curve method.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.