Variable step size destabilizes the Störmer/leapfrog/verlet method

For fixed step-sizeh the Störmer method is stable for the standard test equationÿ= ² y,>0, if and only ifh<2. We show that for variable step sizeh _n there does not exist a (positive) limit onh which ensures stability. Nor can we guarantee stability if, in addition, we limit the step size ratioh _n/h _n–1.This work was supported in part by National Science Foundation Grant DMS 90 15533.     

Perturbation analysis of the orthogonal procrustes problem

Given two arbitrary real matricesA andB of the same size, the orthogonal Procrustes problem is to find an orthogonal matrixM such that the Frobenius norm MA – B is minimized. This paper treats the common case when the orthogonal matrixM is required to have a positive determinant. The stability of the problem is studied and supremum results for the perturbation bounds are derived.     

The algebra of directed complexes

The theory of directed complexes is a higher-dimensional generalisation of the theory of directed graphs. In a directed graph, the simple directed paths form a subset of the free category which they generate; if the graph has no directed cycles, then the simple directed paths constitute the entire category. Generalising this, in a directed complex there is a class of split subsets which is contained in and generates a free -category; when a simple loop-freeness condition is satisfied, the split sets constitute the entire -category. The class of directed complexes is closed under the natural product and join constructions. The free -categories generated by directed complexes include the important examples associated to cubes and simplexes.     

Perturbed unstable variational inequalities with unbounded operators on approximately given sets

The stability and convergence of the solutions of perturbed and regularized variational inequality to the solutions of the primary (unstable a priori) variational inequality with proper monotone operator are investigated. All the objects of inequality: the operatorA, the right-hand partf and the set of constrains are to be perturbed. At the same time no assumptions of boundedness and smoothness of the operatorA are used. The connection between the parameters of perturbations, which guarantees strong convergence of approximate solutions, is established. It is proved that the existence of the solution to the unperturbed variational inequality is necessary and sufficient condition for convergence of the regularized perturbed inequality solutions.This research was supported in part by the Ministry of Science Grant 3481-1-91 and by the Ministry of Absorption Center for Absorption in Science.     

About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets

LetP be a finite partially ordered set. The lengthl(x) of an elementx ofP is defined by the maximal number of elements, which lie in a chain withx at the top, reduced by one. Letw(P) (d(P)) be the maximal number of elements ofP which have the same length (which form an antichain). Further let . The numbers and as well as all partially ordered sets for which these maxima are attained are determined.     

The erdös-dushnik-miller theorem for topological graphs and orders

A topological graph is a graph G=(V, E) on a topological space V such that the edge set E is a closed subset of the product space V x V. If the graph contains no infinite independent set then, by a well-known theorem of Erdös, Dushnik and Miller, for any infinite set LV, there is a subset LL of the same oardinality |L| = |L| such that the restriction G L is a complete graph. We investigate the question of whether the same conclusion holds if we weaken the hypothesis and assume only that some dense subset AV does not contain an infinite independent set. If the cofinality cf (|L|)>|A|, then there is an L as before, but if cf (|L|)<-|A|, then some additional hypothesis seems to be required. We prove that, if the graph GA is a comparability graph and A is a dense subset, then for any set LV such that cf (|L|)>, there is a subset LL of size |L|=|L| such that GL is complete. The condition cf (|L|)> is needed.Research supported by NSERC grant #A5198.     

5－（4－乙酰氧基苯基），10，15，20－三苯基卟啉金属配合物修饰的铂支撑双层脂膜的IV性质

合成并表征了５－（４－乙酰氧基苯基），１０，１５，２０－三苯基卟啉及其金属配合物，将它们作为修饰物，制得铂支撑的双层脂膜，用循环伏安法研究了抗坏血酸的氧化还原反应，并对其机理作了探讨。     

Biological generation of tritiated vitamin D3 metabolites and their purification by high-performance liquid chromatography

Summary A simple, reproducible method for the biological synthesis of tritiated 24,25-dihydroxycholecalciferol, 25,26-dihydroxycholecalciferol and 1,25-dihydroxycholecalciferol is described. Kidney homogenates from both vitamin D deficient and replete chicks were usedin vitro to generate these dihydroxylated metabolites using 25 (23,24-³H) hydroxycholecalciferol as the substrate. Tritiated products were purified by Sephadex LH 20 chromatography followed by high-performance liquid chromatography; the identity of each metabolite was established by chromatography with authentic crystalline preparations.Presented at the Symposium organised by the Chromatography Discussion Group, held at Hatfield Lodge on 29 November 1979.     

Quartic X-splines

Summary The quartic periodic and nonperiodic X-spline are separated from the class of all piecewise-quartic interpolatory polynomials and their orders of convergence, smoothness and complexity of construction are examined. In particular, error estimates of interpolation of smooth functions at uniformly spaced knots by eight quartic X-splines of special interest are presented. The results are illustrated by a numerical example.     

On a pair of functional equations of combinatorial interest

The equations of the title appear in the author's paper Chromatic Sums for Rooted Planar Triangulations, V: Special Equations. (Canadian Journal of Mathematics, 26 (1974), 893–907). They appear in that paper as Equations (24) and (25). They are simultaneous equations for two unknown functionsl andy ₂ of two variablesy ₁ andz. A parameter is involved. The main result is that for = 2 cos (2/n), wheren is a positive integer >1, the two equations can be reduced to a single equation (numbered (49)). Solutions of this are known forn <7. From such solutions we can expect to get information about the averaged chromatic polynomials of planar triangulations with a given number of triangles.The present work is basically an expository paper on the theory given in Chromatic Sums, V, but it includes some new results and many simplifications.