On the moment characteristics of distributions

We study different moment characteristics of (mostly discrete) distributions: general, central, binomial, and factorial moments, and also ordinary and factorial semi-invariants. We establish the relations that connect various kinds of “moments” of arbitrary order, and we derive recursion formulas. Translated fromMetody Matematicheskogo Modelirovaniya, pp. 34–41, 1998.     

QCD corrections to the forward-backward asymmetries of c and b quarks at the Z pole

Measurements of the forward-backward production asymmetry of heavy quarks in Z decays provide a precise determination of . The asymmetries are sensitive to QCD effects, in particular hard gluon radiation. In this paper QCD corrections for and are discussed. The interplay between the experimental techniques used to measure the asymmetries and the QCD effects is investigated using simulated events. A procedure to estimate the correction needed for experimental measurements is proposed, and some specific examples are given. Received: 26 February 1998 / Published online: 2 June 1998     

One-loop divergences of linear gravity with torsion terms

We investigate the role of the torsion field at the quantum level. One-loop counterterms are calculated in the theory with terms quadratic in the torsion field. We have shown that the theory is finite at the one-loop level.     

On the topology of black holes

We establish from local hypotheses some results concerning the final state topology of black holes. We show that the surface of a black hole must have 2-sphere topology and that the topology of space in its vicinity is simple.Dedicated to Ted FrankelThis work has been partially supported by NSF grants DMS-8802877 and DMS-9006678     

Rotational discontinuity in magnetohydrodynamics

Novosibirsk. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 34, No. 3, pp. 3–18, May–June, 1993.     

Mixed block elimination for linear systems with wider borders

The paper is about the stable solution of possibly ill-conditionedbordered linear systems. Given stable solvers for matrix A andfor A^T, we prove that the Govaerts Mixed Block Elimination (BEM)method constitutes a stable solver for the matrix consistingof A or A^T with a border of width 1, and hence by recursionfor a border of any width. We express the algorithm in an efficient,iterative, form. We analyse its operation count, and verifythe theory by extensive numerical experiments. ^*Senior Research Associate of the Belgian National Fund of ScientificResearch NFWO.