Engel Values in Residually Finite Groups

The following theorem is proved. Let n be a positive integer and q a power of a prime p. There exists a number m = m(n, q) depending only on n and q such that if G is any residually finite group satisfying the identity ([x _1,n y ₁] ⋯ [x _m,n y _m ])^q ≡ 1, then the verbal subgroup of G corresponding to the nth Engel word is locally finite.     

A comparative study on the interaction between tin(II) porphyrin and selected group 8B metals for potential application as reduction catalysts

We study the interaction between tin(II) porphyrin (SnPor) with platinum and non-precious Group 8B metals (iron, cobalt and nickel) by density functional theory and discuss the electronic properties of the resulting products. We also model the interaction of the resulting compounds with water where applicable. Our studies indicate that, SnPor-Ni possesses electronic properties similar to SnPor-Pt, suggesting that it may possess similar photocatalytic properties for reduction reactions, such as converting water to hydrogen gas.     

Co-Orthogonal Codes

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.     

Another independent self-dual basis for the trivial variety

We give a new independent self-dual 3-basis for the trivial variety with two binary operations. Received October 24, 2006; accepted in final form January 25, 2007.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

<Emphasis Type="Italic">Comment on</Emphasis>¶Low temperature specific heat of blue bronze K <Emphasis Type="Bold">0.30</Emphasis>MoO <Emphasis Type="Bold">3</Emphasis>, by J. Odin,J.C. Lasjaunias,K. Biljaković, K. Hasselbach,and P. Monceau

Eur. Phys. J. B 24, 315 (2001) Here we comment on a recently published paper on the presence of a phason contribution in the low temperature heat capacity data of the charge-density-wave compounds K_0.3MoO₃ and (TaSe₄)₂I. We have shown that the anomaly in the C _P / T ³ data reported by Odin et al. is straightforwardly interpreted in terms of low energy phonon modes resulting from the peculiar topology of these compounds. Received 21 February 2002 Published online 19 July 2002     

LiNbO3∶Cr∶Cu晶体吸收特性及非挥发全息存储研究

研究了LiNbO3∶Cr∶Cu晶体的吸收特性,发现LiNbO3∶Cr∶Cu（含0.14 wt.% Cr2O3 和 0.011 wt.% CuO）晶体存在两个明显的吸收峰,中心波长分别位于480 nm和660 nm; 随着Cr的含量逐渐减小,Cu的含量逐渐增大,短波段不存在明显吸收峰,掺Cr的含量越大,中心波长在660 nm处的吸收越大；633 nm红光虽然位于中心波长为660 nm的吸收峰内,但它无助于光折变过程.分别采用390 nm紫外光和488 nm蓝光作为敏化光,514 nm绿光作为记录光的记录方案,实现了非挥发全息记录,掺入适量的Cr( 比如NCr=2.795×1025 m－3,NCr/ NCu=1)有助于全息记录性能的提高.     

Finite element error estimates for non-linear elliptic equations of monotone type

Summary In this paper we shall consider the application of the finite element method to a class of second order elliptic boundary value problems of divergence form and with gradient nonlinearity in the principal coefficient, and the derivation of error estimates for the finite element approximations. Such problems arise in many practical situations — for example, in shock-free airfoil design, seepage through coarse grained porous media, and in some glaciological problems. By making use of certain properties of the nonlinear coefficients, we shall demonstrate that the variational formulations associated with these boundary value problems are well-posed. We shall also prove that the abstract operators accompanying such problems satisfy certain continuity and monotonicity inequalities. With the aid of these inequalities and some standard results from approximation theory, we show how one may derive error estimates for the finite element approximations in the energy norm.     

The structure of an Fe monolayer on the Ni (111) surface. A density-functional study using the generalized gradient approximation

Using a density-functional method that employs linear combinations of atomic orbitals as basis sets, nonlocal norm-conserving pseudopotentials and the generalized gradient approximation for exchange and correlation, we found that at 0 K the atoms of an Fe monolayer on the Ni (111) surface occupy hcp rather than fcc sites, in keeping with previous predictions made using the ab initio all-electron full-potential linearized augmented plane wave method with the local spin density approximation.     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001