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

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

Surface chemical analysis of raw cotton fibres and associated materials

The surface chemical composition of raw unscoured cotton was successfully investigated by the surface analytical techniques X-ray Photoelectron Spectroscopy (XPS) and Time of Flight Secondary Ion Mass Spectrometry (ToF-SIMS). The presence of non-cellulosic material at the fibre surface was established and determined to be a complex mixture of fatty acids, alcohols, alkanes, esters and glycerides. The effect of scouring and bleaching was to reduce the surface concentration of these materials but even after aqueous processing some non-cellulosic material residue was still detected at the fibre surface.     

Bifunctional pyridyl alcohols with the bicyclo[3.3.0]octane scaffold in the asymmetric addition of diethylzinc to aldehydes

Some new pyridyl alcohols with the cis-bicyclo[3.3.0]octane scaffold were synthesized and used as chiral ligands for the enantioselective addition of diethylzinc to aldehydes. Ligands 4 were found to be far superior to the C₂-symmetric ligands 2 in terms of enantioselectivities. Quantitative yields and enantiomeric excesses of up to 92% were obtained when the ligand 4 was used. The carbonyl function in 4 proved to be beneficial for the high enantioselectivities in the addition of diethylzinc to aldehydes. Conversion of the carbonyl group into oxime or oxime ether group led to a sort of more active ligands, which catalyzed the same reaction with rate acceleration.     

A new Far-Infrared Fourier Spectrometer

Summary This article describes a new commercial Far-Infrared Fourier Spectrometer system which has been developed for routine spectroscopy in the 10–1000 cm^–1 spectral region. The instrument incorporates real-time data processing and has been automated wherever possible for foolproof operation. A versatile sample chamber allows a wide range of spectroscopic studies to be performed, on solids, liquids and gases over a wide range of temperatures. A number of spectra are presented to illustrate the performance and typical applications of this Fourier spectrometer.

---

Ein neues fourier-spektrometer für das ferne infrarot

Zusammenfassung Nach einer kurzen Einführung in die Methode der Fourier-Spektroskopie wird ein neues kommerzielles Fern-Infrarot-Fourier-Spektrometer mit real-time Datenverarbeitungsanlage beschrieben. Das Gerät ist für die Spektroskopie im Bereich 10–1000 cm^–1 konstruiert und weitgehend automatisiert. Eine vielseitig verwendbare Probenkammer ermöglicht umfangreiche spektroskopische Untersuchungen von Festkörpern, Flüssigkeiten und Gasen in einem sehr großen Temperaturbereich. Anhand einer Reihe von Spektren werden Leistung und typische Anwendungen dieses Fourier-Spektrometers erläutert.

Lecture presented at Euroanalysis I Conference, 28. 8.–1. 9. 1972 in Heidelberg, Germany.     

A Laplace-like method for solving linear difference equations

This paper is concerned with the problem of solving linear difference equations of ordern with constant coefficients and with given initial conditions in which the variable runs not only through the integers but over . The main idea is the introduction of a suitable commutative ring of functions with discrete convolution as multiplication rule which works, although it is not a field. The existence of inverses is studied and, after the introduction of suitable functions, the problem is reduced by means of a Laplace-like relation to an algebraic equation. Examples of application are given. Finally some remarks make the connection with the Operational Calculus of Mikusinski and with the Operational Calculus of Fenyö. The advantages of this method lie in the fact that it is applicable to functions others than the step functions, in its simplicity from the theoretical point of view, in its usefulness even when computation is required and in its formal similarity to the classical treatment of linear differential equations with constant coefficients.     

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.     

Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

Symmetrische Permutationsmengen

A permutation set (M, I) consisting of a setM and a set of permutations ofM, is calledsymmetric, if for any two permutations, the existence of anx M with (x) (x) and ^–1 (x) = ^–1 (x) implies ^–1 = ^–1 , andsharply 3-transitive, if for any two triples (x ₁,x ₂,x ₃), (y ₁,y ₂,y ₃) M ³ with|{x ₁,x ₂,x ₃ }| = |{y ₁,y ₂,y ₃ }| = 3 there is exactly one permutation with(x ₁) =y ₁,(x ₂) =y ₂,(x ₃) =y ₃. The following theorem will be proved.THEOREM.Let (M, ) be a sharply 3-transitive symmetric permutation set with |M|3, such that contains the identity. Then is a group and there is a commutative field K such that and the projective linear group PGL(2, K) are isomorphic.     

Extended iterative methods for the solution of operator equations

Summary Given an iterative methodM ₀, characterized byx ^(k+1=G ₀(x( ^k )) (k0) (x(⁰) prescribed) for the solution of the operator equationF(x)=0, whereF:XX is a given operator andX is a Banach space, it is shown how to obtain a family of methodsM _p characterized byx ^(k+1=G _p (x( ^k )) (k0) (x(⁰) prescribed) with order of convergence higher than that ofM _o. The infinite dimensional multipoint methods of Bosarge and Falb [2] are a special case, in whichM ₀ is Newton's method.Analogues of Theorems 2.3 and 2.36 of [2] are proved for the methodsM _p, which are referred to as extensions ofM ₀. A number of methods with order of convergence greater than two are discussed and existence-convergence theorems for some of them are proved.Finally some computational results are presented which illustrate the behaviour of the methods and their extensions when used to solve systems of nonlinear algebraic equations, and some applications currently being investigated are mentioned.