The universal nilpotent group compactification of a semigroup

The purpose of this paper is to introduce an algebra of functions on a semitopological semigroup and to study these functions from the point of view of universal semigroup compactification. We show that the corresponding semigroup compactification of this algebra is universal with respect to the property of being a nilpotent group.

     

Optimal algebraic multilevel preconditioning for local refinement along a line

The application of some recently proposed algebraic multilevel methods for the solution of two-dimensional finite element problems on nonuniform meshes is studied. The locally refined meshes are created by the newest vertex mesh refinement method. After the introduction of this refinement technique it is shown that, by combining levels of refinement, a preconditioner of optimal order can be constructed for the case of local refinement along a line. Its relative condition number is accurately estimated. Numerical tests demonstrating the performance of the proposed preconditioners will be reported in a forthcoming paper.     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.     

Infinite-dimensional linear groups with restrictions on subgroups that are not soluble <Emphasis Type="Italic">A</Emphasis><Subscript>3</Subscript>-groups

We are concerned with infinite-dimensional locally soluble linear groups of infinite central dimension that are not soluble A₃-groups and all of whose proper subgroups, which are not soluble A₃-groups, have finite central dimension. The structure of groups in this class is described. The case of infinite-dimensional locally nilpotent linear groups satisfying the specified conditions is treated separately. A similar problem is solved for infinite-dimensional locally soluble linear groups of infinite fundamental dimension that are not soluble A₃-groups and all of whose proper subgroups, which are not soluble A₃-groups, have finite fundamental dimension. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 548–559, September–October, 2007.     

Quantization of complex Lagrangian submanifolds

Let Λ be a smooth Lagrangian submanifold of a complex symplectic manifold X. We construct twisted simple holonomic modules along Λ in the stack of deformation-quantization modules on X.     

On cellularization for simplicial presheaves and motivic homotopy

We construct cellular homotopy theories for categories of simplicial presheaves on small Grothendieck sites and discuss applications to the motivic homotopy category of Morel and Voevodsky.     

A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations

Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.