THEORY AND COMPUTATION OF RESTRICTED LINEAR MODELS

Least squares inverses and complementary matrices are used to develop a comprehensive theory of estimation for a restricted linear model.Testable hypotheses as defined in Searle [8] are extended to involve nonestimable functions.An explicit expression for the sum of squares of deviation from the null hypothesis under the general setup with restrictions (Rao [7,p.242])and the corresponding number of degrees of freedom are obtained for implementation on computers.     

和图、整和图与模和图的几个结果

Let N denote the set of positive integers. The sum graph G^＋（S） of a finite subset S belong to N is the graph （S, E） with uv ∈ E if and only if u ＋ v ∈ S. A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S belong to N. By using the set Z of all integers instead of N, we obtain the definition of the integral sum graph. A graph G = （V, E） is a mod sum graph if there exists a positive integer z and a labelling, λ, of the vertices of G with distinct elements from {0, 1, 2,..., z - 1} so that uv ∈ E if and only if the sum, modulo z, of the labels assigned to u and v is the label of a vertex of G. In this paper, we prove that flower tree is integral sum graph. We prove that Dutch m-wind-mill （Dm） is integral sum graph and mod sum graph, and give the sum number of Dm.     

On solving equations of algebraic sum of equal powers

It is well known that a system of equations of sum of equal powers can be converted to an algebraic equation of higher degree via Newton's identities. This is the Viete-Newton theorem. This work reports the generalizations of the Viete-Newton theorem to a system of equations of algebraic sum of equal powers. By exploiting some facts from algebra and combinatorics, it is shown that a system of equations of algebraic sum of equal powers can be converted in a closed form to two algebraic equations, whose degree sum equals the number of unknowns of the system of equations of algebraic sum of equal powers.     

Chromatic sums of biloopless nonseparable near-triangulations on the projective plane

In this paper, the chromatic sum functions of rooted biloopless nonseparable near-triangulations on the sphere and the projective plane are studied. The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equations of such maps are derived. An asymptotic evaluation and some explicit expression of enumerating functions are also derived.     

WEIGHTED NONLINEAR REGRESSION

Minimization of the weighted nonlinear sum of squares of differences may be converted to the minimization of sum of squares. The Gauss-Newton method is recalled and the length of the step of the steepest descent method is determined by substituting the steepest descent direction in the Gauss-Newton formula. The existence of minimum is shown.     

A RECURSIVE ALGORITHM OF THE PARAMETER ESTIMAION WHEN THE NOISE IS COLORED

When the noise is white the recursive algorithm of the parameter estimation is discussed in [1], [2]. When the noise is n-Step correlated the recursive algorithm of the parameter estimation is discussed in [3]. In this paper when the noise is colored the recursive algorithm of the parameter estimation is discussed and the recursive algorithm is given.     

闭曲面丛的一类曲面连通和中的本质闭曲面

In this paper, we will characterize all types of essential closed surfaces in a class of surface sum ofI-bundle of closed surfaces, and give an application of the classificatioa in the surface sum of two 3-manifolds.     

Problem-Sloving and Numbers(2)

Example Find the sum of the consecutive inters from 1 to 100 without the use of calculator. Solution Step1 Understanding the Problem The sum can be found by a simpler method rather than the     

Bayesian Estimation for the Order of INAR(q) Mo del

In this paper, we consider the problem of determining the order of INAR(q) model on the basis of the Bayesian estimation theory. The Bayesian es-timator for the order is given with respect to a squared-error loss function. The consistency of the estimator is discussed. The results of a simulation study for the estimation method are presented.     

TENSOR SUM AND DYNAMICAL SYSTEMS

In this paper we introduce the concept of tensor sum semigroups. Also we have given the examples of tensor sum operators which induce dynamical system on weighted locally convex function spaces.     

关于DIRICHLET L-函数的四次加权均值分布

利用经典K LOOSTERM ANN和估计、特征和的性质及其解析方法讨论了D IRICH LET L-函数的四次加权均值分布,得出一个有趣的加权均值分布定理.     

Dirichlet L-函数倒数的2k次加权均值

本文主要目的是利用经典的Ｋｌｏｏｓｔｅｒｍａｎｎ和估计及其解析方法研究Ｄｉｒｉｃｈ－ｌｅｔ Ｌ-函数倒数的 ２ｋ次加权均值,得到了一个较为精确的渐近公式．     

Partitions into two Lehmer numbers

We prove an asymptotic formula for the number of representations of an integer as sum of two Lehmer numbers which implies that under some natural restrictions each sufficiently large integer is a sum of two such numbers.     

Partitions into two Lehmer numbers

We prove an asymptotic formula for the number of representations of an integer as sum of two Lehmer numbers which implies that under some natural restrictions each sufficiently large integer is a sum of two such numbers.     

High-dimensional D. H. Lehmer problem over short intervals

Letk be a positive integer and n a nonnegative integer,0 λ1,...,λk+1 ≤ 1 be real numbers and w =(λ1,λ2,...,λk+1).Let q ≥ max{[1/λi ]:1 ≤ i ≤ k + 1} be a positive integer,and a an integer coprime to q.Denote by N(a,k,w,q,n) the 2n-th moment of(b1··· bk c) with b1··· bk c ≡ a(mod q),1 ≤ bi≤λiq(i = 1,...,k),1 ≤ c ≤λk+1 q and 2(b1+ ··· + bk + c).We first use the properties of trigonometric sum and the estimates of n-dimensional Kloosterman sum to give an interesting asymptotic formula for N(a,k,w,q,n),which generalized the result of Zhang.Then we use the properties of character sum and the estimates of Dirichlet L-function to sharpen the result of N(a,k,w,q,n) in the case ofw =(1/2,1/2,...,1/2) and n = 0.In order to show our result is close to the best possible,the mean-square value of N(a,k,q) φk(q)/2k+2and the mean value weighted by the high-dimensional Cochrane sum are studied too.     

On a Problem of Lehmer on Partitions into Squares

In 1948, D.H.Lehmer published a brief work discussing the difference between representations of the integer n as a sum of squares and partitions of n into square summands. In this article, we return to this topic and consider four partition functions involving square parts and prove various arithmetic properties of these functions. These results provide a natural extension to the work of Lehmer.     

Propriétés diophantiennes du développement en cotangente continue de Lehmer

Diophantine Properties of Lehmer’s Continued Cotangent Developments. This article deals with an algorithm devised by Lehmer which enables us to write any real positive number as the sum of an alternating series of cotangents of integers n _ν, ν ≥ 0, in a unique way. We continue the work begun by Lehmer and continued by Shallit: amongst other things, we give explicitly the link between the rational approximations of a given real number coming from this algorithm and the usual convergents of the same real number and we produce a quasi-optimal bound for the growth of the sequence (n _ν)_{ν ≥ 0} associated to an algebraic number. We also determine the regular continued fractions of an exceptional class of continued cotangent developments, which enables us to produce optimal irrationality measures of these expansions.     

On a Problem of D. H. Lehmer

The main purpose of this paper is to use the Fourier expansion for character sums and the mean value theorem of Dirichlet L-functions to study the asymptotic property of the difference between a D. H. Lehmer number and its inverse modulo p （an odd prime）, A interesting mean square value formula is also given.     

On the first occurrence of certain patterns of quadratic residues and non-residues

Effective upper bounds are obtained for the first occurrence of certain mixed patterns of quadratic residues and non-residues using the character sum estimates of D. A. Burgess and a proof of a conjecture of E. Lehmer.     

Sur les bonnes valeurs initiales de la suite de Lucas–Lehmer

In this article we give an infinite number of good initial values for the Lucas–Lehmer sequence.