相依误差广义线性模型的M估计的Bahadur表示

考虑如下广义线性模型y_i=h(x~T_i,β)+e_i=1,2,…,n,其中e_i=G(…,ε_(i-1),ε_i),h是一个连续可导函数,ε_i是独立同分布的随机变量,并且它的期望为0,方差σ~2有限.本文给出了参数β的M估计,并且得到了该估计的Bahadur表示,该结论推广了线性模型的相关结论.应用M估计的Bahadur表示,得到了相依误差的线性回归模型,poisson模型,logistic模型和独立误差的广义线性模型等模型的渐近性质.     

M-矩阵线性互补问题模系多分裂迭代方法的收敛性

首先证明了M-矩阵的H-相容分裂都是正则分裂,反之不成立.这表明对于M-矩阵而言,其正则分裂包含H-相容分裂.然后针对系数矩阵为M-矩阵的线性互补问题,建立了两个收敛定理:一是模系多分裂迭代方法关于正则分裂的收敛定理;二是模系二级多分裂迭代方法关于外迭代为正则分裂和内迭代为弱正则分裂的收敛定理.     

Linear Clique‐Width for Hereditary Classes of Cographs

The class of cographs is known to have unbounded linear clique‐width. We prove that a hereditary class of cographs has bounded linear clique‐width if and only if it does not contain all quasi‐threshold graphs or their complements. The proof borrows ideas from the enumeration of permutation classes.     

Efficient remainder rule

Understanding the solution of a problem may require the reader to have background knowledge on the subject. For instance, finding an integer which, when divided by a nonzero integer leaves a remainder; but when divided by another nonzero integer may leave a different remainder. To find a smallest positive integer or a set of integers following the given conditions, one may need to understand the concept of modulo arithmetic in number theory. The Chinese Remainder Theorem is a known method to solve these types of problems using modulo arithmetic. In this paper, an efficient remainder rule has been proposed based on basic mathematical concepts. These core concepts are as follows: basic remainder rules of divisions, linear equation in slope intercept form, arithmetic progression and the use of a graphing calculator. These are easily understood by students who have taken prealgebra or intermediate algebra.     

On Cartan's theorem for linear operators

In this paper, we describe a second main theorem of holomorphic curves in , of hyper‐order strictly less than 1, that involves a general linear operator . As an application, we derive a truncated second main theorem of degenerate holomorphic curves of hyper‐order strictly less than 1 using Nochka weights.     

On separating a fixed point from zero by invariants

Assume a fixed point v∈V^G can be separated from zero by a homogeneous invariant f∈𝕜[V]^G of degree p^rd, where p>0 is the characteristic of the ground field 𝕜 and p,d are coprime. We show that then v can also be separated from zero by an invariant of degree p^r, which we obtain explicitly from f. It follows that the minimal degree of a homogeneous invariant separating v from zero is a p-power.     

Nonmonotone Inexact Newton Method for the Extended Linear Complementarity Problem

This paper presents a nonmonotone inexact Newton-type method for the extended linear complementarity problem (ELCP). We first reformulate the optimization system of the ELCP problem into a system of smoothed equations. Then we solve this system by a nonmonotone inexact Newton-type algorithm. The global convergence is obtained and numerical tests for some classes of ELCP include linear complementarity, horizontal linear complementarity, and generalized linear complementarity problems are also given to show the e?ciency of the proposed algorithm.     

Central Schur rings over the projective special linear groups

In [1 Bannai, E. (1991). Subschemes of some association schemes. J. Algebra 14:167–188.[Crossref], [Web of Science ®] , [Google Scholar]], Bannai presents a fusion condition and uses this to consider central Schur rings (S-rings) over the simple groups PSL(2,q) where q is a prime power. In this paper, we concretely describe all such S-rings in terms of symmetric S-rings over cyclic groups. The final section discusses counting these.