Convergence of ‖π approximations to the strict approximation in R n

Suppose V is a subspace of R ⁿ and assume that ‖_∞-norm is obtained as a suitable limit of convex functions {π _m }. Let x _m be a best π _m -approximation to x by elements of V. We prove that the sequence x _m converges to the strict best approximation of x. As a crollary we obtain convergence of the best ‖_πm -approximation.     

Asymptotic expression of the linear discrete best -approximation

Let h_p, 1<p<∞, be the best ℓ_p-approximation of the element from a proper affine subspace K of , hK, and let denote the strict uniform approximation of h from K. We prove that there are a vector and a real number a, 0a1, such that

for all p>1, where with γ_p=o(a^p/p).     

Analytic hypoellipticity in the presence of nonsymplectic characteristic points

Recently, N. Hanges proved that the operator

     

Banach空间中非线性混合型脉冲积微分方程的解

本文讨论Ｂａｎａｃｈ空间中带定时脉冲的非线性混合型积微分方程，利用Ｄａｒｂｏ不动点定理与增算子不动点定理证明了解与最大解和最小解的存在性，得到了最大解和最小解的迭代公式．     

4一致(ξ)-超图的最小边数的上界

主要讨论了4一致l-超图的最小边数与最小上色数的关系,给出了上色数为3的4一致l-超图的最小边数的一个上界.     

Strict stability criteria for dynamic systems on time scales

In this paper we obtain sufficient conditions for strict stability to hold for dynamic systems on time scales.     

On a new class of abstract neutral differential equations

In this work we introduce a new class of abstract neutral differential equations and study the existence of mild and strict solutions. Some concrete applications involving partial neutral differential equations are considered.     

集值优化问题严格有效解的一、二阶最优性条件

首先定义了集值优化问题的m阶局部严格有效解并在赋范空间中研究了解的一些性质.在一定条件下,利用Dini导算子和支撑函数确立了m≥1阶严格有效解存在的充分必要条件.     

K-theory of equivariant quantization

Using an equivariant version of Connes? Thom isomorphism, we prove that equivariant K-theory is invariant under strict deformation quantization for a compact Lie group action.     

Planar unit-distance graphs having planar unit-distance complement

A graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V into the plane such that every pair of adjacent vertices are at unit distance apart. If an embedding of V satisfies the condition that two vertices are adjacent if and only if they are at unit distance apart, then G is called a strict unit-distance graph in the plane. A graph G is a (strict) co-unit-distance graph, if both G and its complement are (strict) unit-distance graphs in the plane. We show by an exhaustive enumeration that there are exactly 69 co-unit-distance graphs (65 are strict co-unit-distance graphs), 55 of which are connected (51 are connected strict co-unit-distance graphs), and seven are self-complementary.