Crowns,cutsets, and valuable partial orders

We consider the problem of recognizing those partial orders which admit a valuation: this is a linear-algebraic condition which arises naturally in an algebraic/geometric context. We show that a partial order has at most one valuation (which is integer-valued) and present various structural conditions which are either necessary or sufficient for a partial order to be valuable. The first main result is a reduction theorem which allows us to restrict attention to those partial orders which do not have a bounded cutset. We use this and a theorem of Kelly and Rival to prove the second main result: that every contraction of a bounded partial order is fibre-valuable if and only if the partial order is a dismantlable lattice. This result has a geometric interpretation.This research was supported by the Natural Sciences and Engineering Research Council of Canada under operating grant OGP0105392.     

A time- and spaceadaptive algorithm for the linear time-dependent Schrödinger equation

Summary. We prove an a posteriori error estimate for the linear time-dependent Schr?dinger equation in . From this, we derive a residual based local error estimator that allows us to adjust the mesh and the time step size in order to obtain a numerical solution with a prescribed accuracy. As a special feature, the error estimator controls localization and size of the finite computational domain in each time step. An algorithm is described to compute this solution and numerical results in one space dimension are included. Received March 17, 1995     

Potential theory of hyperfinite Dirichlet forms

In this paper, we are going to study the capacity theory and exceptionality of hyperfinite Dirichlet forms. We shall introduce positive measures of hyperfinite energy integrals and associated theory. Fukushima's decomposition theorem will be established on the basis of discussing hyperfinite additive functionals and hyperfinite measures. We shall study the properties of internal multiplicative functionals, subordinate semigroups and subprocesses. Moreover, we shall discuss transformation of hyperfinite Dirichlet forms.Research was supported by the National Natural Science Foundation of P.R. China, No. 18901004. The support from the position of Wissenschaftliche Hilfskraft of Ruhr-University Bochum under Prof. Sergio Albeverio is also acknowledged.     

The cascadic multigrid method for elliptic problems

Summary. The paper deals with certain adaptive multilevel methods at the confluence of nested multigrid methods and iterative methods based on the cascade principle of [10]. From the multigrid point of view, no correction cycles are needed; from the cascade principle view, a basic iteration method without any preconditioner is used at successive refinement levels. For a prescribed error tolerance on the final level, more iterations must be spent on coarser grids in order to allow for less iterations on finer grids. A first candidate of such a cascadic multigrid method was the recently suggested cascadic conjugate gradient method of [9], in short CCG method, whichused the CG method as basic iteration method on each level. In [18] it has been proven, that the CCG method is accurate with optimal complexity for elliptic problems in 2D and quasi-uniform triangulations. The present paper simplifies that theory and extends it to more general basic iteration methods like the traditional multigrid smoothers. Moreover, an adaptive control strategy for the number of iterations on successive refinement levels for possibly highly non-uniform grids is worked out on the basis of a posteriori estimates. Numerical tests confirm the efficiency and robustness of the cascadic multigrid method. Received November 12, 1994 / Revised version received October 12, 1995     

Crystal algebra

We define the crystal algebra, an algebra which has a base of elements of crystal bases of a quantum group. The multiplication is defined by the tensor product rule of crystal bases. A universal n-colored crystal algebra is defined. We study the relation between those algebras and the tensor algebras of the crystal algebra of U _q (sl(2)) and give a presentation by generators and relations for the case of U _q (sl(n)).     

One-dimensional perturbations of the shift

The structure of isometries on a Hilbert space are well studied. In this paper we study contractions which are one-dimensional perturbations of isometries, in particular, perturbations of the shift operator onH ².     

A Bound on the Total Chromatic Number

. The proof is probabilistic. Received: November 26, 1996     

On the distance to uncontrollability and the distance to instability and their relation to some condition numbers in control

Summary. According to the methodology of [6], many measures of distance arising in problems in numerical linear algebra and control can be bounded by a factor times the reciprocal of an appropriate condition number, where the distance is thought of as the distance between a given problem to the nearest ill-posed problem. In this paper, four major problems in numerical linear algebra and control are further considered: the computation of system Hessenberg form, the solution of the algebraic Riccati equation, the pole assignment problem and the matrix exponential. The distances considered here are the distance to uncontrollability and the distance to instability. Received November 4, 1995 / Revised version received March 4, 1996     

A Bahadur efficiency comparison between one and two sample rank statistics and their sequential rank statistic analogues

One and two sample rank statistics are shown in general to be more efficient in the Bahadur sense than their sequential rank statistic analogues as defined by Mason (1981, Ann. Statist.9 424–436) and Lombard (1981, South African Statist. J.15 129–152), even though the two families of statistics (those based on full ranks and those based on sequential ranks) have the same Pitman efficiency against local alternatives. In the process, general results on large deviation probabilities and laws of large numbers for statistics based on sequential ranks are obtained.