John Clifford, free church leader and preacher.

Mode of access: Internet.

A treatise on infinitesimal calculus, containing differential and integral calculus, calculus of variations, applications to algebra and geometry, and analytical mechanics.

Vol. 3 and 4 form the author's Treatise on analytical mechanics.

Four worthies : John Chamberlain, Anne Clifford, John Taylor, Oliver Heywood.

Mode of access: Internet.

Quantum doubles from a class of noncocommutative weak Hopf algebras

The concept of biperfect (noncocommutative) weak Hopf algebras is introduced and their properties are discussed. A new type of quasi-bicrossed products is constructed by means of weak Hopf skew-pairs of the weak Hopf algebras which are generalizations of the Hopf pairs introduced by Takeuchi. As a special case, the quantum double of a finite dimensional biperfect (noncocommutative) weak Hopf algebra is built. Examples of quantum doubles from a Clifford monoid as well as a noncommutative and noncocommutative weak Hopf algebra are given, generalizing quantum doubles from a group and a noncommutative and noncocommutative Hopf algebra, respectively. Moreover, some characterizations of quantum doubles of finite dimensional biperfect weak Hopf algebras are obtained. (C) 2004 American Institute of Physics.

Central elements of the elliptic Zn monodromy matrix algebra at roots of unity

The central elements of the algebra of monodromy matrices associated with the Z(n) R-matrix are studied. When the crossing parameter w takes a special rational value w = n/N, where N and n are positive coprime integers, the center is substantially larger than that in the generic case for which the quantum determinant provides the center. In the trigonometric limit, the situation corresponds to the quantum group at roots of unity. This is a higher rank generalization of the recent results by Belavin and Jimbo. (c) 2004 Elsevier B.V. All rights reserved.

A Computer Algebra Application to Determination of Lie Symmetries of Partial Differential Equations

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

The Automorphism Group of the Free Algebra of Rank Two

The theorem of Czerniakiewicz and Makar-Limanov, that all the automorphisms of a free algebra of rank two are tame is proved here by showing that the group of these automorphisms is the free product of two groups (amalgamating their intersection), the group of all affine automorphisms and the group of all triangular automorphisms. The method consists in finding a bipolar structure. As a consequence every finite subgroup of automorphisms (in characteristic zero) is shown to be conjugate to a group of linear automorphisms.

Operational Methods in the Environment of a Computer Algebra System

This article presents the principal results of the doctoral thesis “Direct Operational Methods in the Environment of a Computer Algebra System” by Margarita Spiridonova (Institute of mathematics and Informatics, BAS), successfully defended before the Specialised Academic Council for Informatics and Mathematical Modelling on 23 March, 2009.

Quasi-Monte Carlo Methods for some Linear Algebra Problems. Convergence and Complexity

We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(−1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.