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.     

On cubature formulae with a minimal number of knots

Summary In this paper an approach is outlined to the two-dimensional analogon of the Gaussian quadrature problem. The main results are necessary and sufficient conditions for the existence of cubature formulae which are exact for all polynomials of degree m and which have a minimal number of 1/2k(k+1) knots,k=[m/2]+1. Ifm is odd, similar results are due to I.P. Mysovskikh ([5, 6]) which will be derived in a new way as a special case of the general characterization given here. Furthermore, it will be shown how this characterization can be used to construct minimal formulae of even degree.     

Error bounds for continued fractionsK(1/b n)

Summary A priori truncation error bounds are obtained for continued fractions of the formK(1/b _n),b _n complex. The error bounds are easily applied to the case whenb _n0 asn. A numerical example involving the complex error function is given.     

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.     

Characterization of the normal distribution by constant regression of quadratic statistics on linear statistics

This paper contains applications of theorems of [1] for quadratic statistics which have constant regression on linear statistics. Two theorems are proved. The first is a sufficient condition which assumes that the characteristic function of a sample is an entire function. The second gives a new characterization of the normal distribution.     

On the divergence of certain Hermite-Fejér interpolation

Summary In his paper [1]P. Turán discovers the interesting behaviour of Hermite-Fejér interpolation (based on the ebyev roots) not describing the derivative values at exceptional nodes {_n} _n=1 . Answering to his question we construct such exceptional node-sequence for which the mentioned process is bounded for bounded functions whenever –1<x<1 but does not converge for a suitable continuous function at any point of the whole interval [–1, 1].     

~(14)N ENDOR Study on Bis(2-Hydroxylphenyl Ketoxime)-~(63)Cu(Ⅱ) Complex

The ENDOR spectrum of ~(14)N-~(63)Cu-HAP complex in DMSO/EtOH (5:1) freezing solution at 20 K has been studied using orientational selective method in this paper. The anisotropic superhyperfine coupling tensor and qusdrupole coupling tensor of ligand ~(14)N nucleus, and the superhyperfine coupling tensor of various ~1H nuclei have been measured precisely. Comparing the superhyperfine coupling tensor of ~(14)N-nucleus with previous work shows that the analytical method of spectrum is reasonable and the data are reliable in our previous work.