部分线性模型中估计的收敛速度

考虑回归模型（Ⅰ）：其中（ｘ＿ｉ，ｔ＿ｉ）是固定非随机设计点列，ｘ＿ｉ＝（ｘ＿（ｉｌ），…，ｘ＿（ｉｐ））＇β＝（β＿１，…，β＿ｐ）＇（ｐ＞１），ｇ是定义在［０，１］上的未知函数，β是未知待估参数，０＜ｔ＿ｉ＜１，ｅ＿ｉ是ｉ．ｉ．ｄ．随机误差，且Ｅｅ＿ｉ＝０，Ｅｅ＝σ￣２＜∞。基于ｇ的估计取一类非参数权估计（包括常见的核估计和近邻估计），我们讨论了β的最小二乘估计及ｇ的估计的最优强弱收敛速度。     

Contact Classification of Linear Ordinary Differential Equations: I

It is known that a linear ordinary differential equation of order n3 can be transformed to the Laguerre–Forsyth form y ⁽ⁿ⁾= _i=3 ⁿ a _n–i (x)y ^(n–i) by a point transformation of variables. The classification of equations of this form in a neighborhood of a regular point up to a contact transformation is given.     

Sequential Discrete p-Facility Models for Competitive Location Planning

Two new models for duopolistic competitive discrete location planning with sequential acting and variable delivered prices are introduced. If locations and prices are assumed to be set once and for all by the players, the resulting bilevel program is nonlinear. Under the assumption that further price adjustments are possible, i.e., that a Nash equilibrium in prices is reached, the model can be simplified to a linear discrete bilevel formulation. It is shown that in either situation players should not share any locations or markets if they strive for profit-maximization.For the situation with price adjustments, a heuristic solution procedure is suggested. In addition, the bilevel models are shown to serve as a basis from which different well-known location models – as, for example, the p-median problem, the preemptive location problem and the maximum covering problem – can be derived as special cases.     

On Some Extremal Properties of Lagrange Interpolatory Polynomials

In this paper, we will show that Lagrange interpolatory polynomials are optimal for solving some approximation theory problems concerning the finding of linear widths.In particular, we will show that

Full-size image

, where _n is a set of the linear operators with finite rank n+1 defined on −1,1], and where _n+1 denotes the set of polynomials p=∑_i=0ⁿ⁺¹a_ixⁱ of degreen+1 such that a_n+11. The infimum is achieved for Lagrange interpolatory polynomial for nodes .     

Cohen–Macaulay Multi–Rees Algebras

Let A be a local ring, and let I ₁,...,I _r A be ideals of positive height. In this article we compare the Cohen–Macaulay property of the multi–Rees algebra R _A (I ₁,...,I _r ) to that of the usual Rees algebra R _A (I ₁ ··· I _r ) of the product I ₁ ··· I _r . In particular, when the analytic spread of I ₁ ··· I _r is small, this leads to necessary and sufficient conditions for the Cohen–Macaulayness of R _A (I ₁,...,I _r ). We apply our results to the theory of joint reductions and mixed multiplicities.     

The Proalgebraic Completion of Rigid Groups

A finitely generated group is called representation rigid (briefly, rigid) if for every n, has only finitely many classes of simple representations in dimension n. Examples include higher rank S-arithmetic groups. By Margulis super rigidity, the latter have a stronger property: they are representation super rigid; i.e., their proalgebraic completion is finite dimensional. We construct examples of nonlinear rigid groups which are not super rigid, and which exhibit every possible type of infinite dimensionality. Whether linear representation rigid groups are super rigid remains an open question.     

On Clique-Transversals and Clique-Independent Sets

A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. A clique-independent set is a subset of pairwise disjoint cliques of G. Denote by _C (G) and _C (G) the cardinalities of the minimum clique-transversal and maximum clique-independent set of G, respectively. Say that G is clique-perfect when _C (H)= _C (H), for every induced subgraph H of G. In this paper, we prove that every graph not containing a 4-wheel nor a 3-fan as induced subgraphs and such that every odd cycle of length greater than 3 has a short chord is clique-perfect. The proof leads to polynomial time algorithms for finding the parameters _C (G) and _C (G), for graphs belonging to this class. In addition, we prove that to decide whether or not a given subset of vertices of a graph is a clique-transversal is Co-NP-Complete. The complexity of this problem has been mentioned as unknown in the literature. Finally, we describe a family of highly clique-imperfect graphs, that is, a family of graphs G whose difference _C (G)– _C (G) is arbitrarily large.     

Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa

This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any -minihyper, with , where , is the disjoint union of points, lines,..., -dimensional subspaces. For q large, we improve on this result by increasing the upper bound on non-square, to non-square, square, , and (4) for square, p prime, p<3, to . In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry . For the coding-theoretical problem, our results classify the corresponding codes meeting the Griesmer bound.