最佳L2局部逼近存在唯一的充分必要条件

本文给出了最佳Ｌ２局部逼近的存在唯一性定理，设ｆ∈Ｌ２（０，δ），Ｓｎ＝ｓｐａｎ（ｕ０，ｕ１，．．．Ｕｎ－１）Ｃ＾ｎ－１（０，δ），且ｄｅｔＷｎ（ｕ０，ｕ１，．．．ｕｎ－１；０）≠０，那么，当ｘ→０时，网（Ｐｘ（ｆ，Ｓｎ）收敛于Ｓｎ中某元素Ｐ０（ｆ，Ｓｎ）的充要条件为：ｆ＝Ｐｎ－１＋ｈ，其中Ｐｎ－１（ｔ）＝ｎ－１∑ｉ＝１ａｉｔｉ（ｈ，１）ｘ＝０（Ｘ＾ｎ），ｘ→０，且Ｐ０（ｆ，Ｓｎ）＝ＵＷ＾－１ｎＡ     

具有阻尼项的非线性波动方程的初值问题

本文研究具有阻尼项的非线性波动方程的初值问题ｕｔｔ－２ｂｕｘｘｔ＋ａｕｘｘｘｘ＝β（ｕｘ＾ｎ）ｘ,;ｕ（ｘ,０）＝ψ（ｘ）,ｕｔ（ｘ,０）＝ψ（ｘ）,其中ｂ〉０,β≠０为任意实数,ｎ≥２为整 当ａ≠ｂ＾２,ψ∈Ｌ１（Ｒ）∩Ｈ＾２（Ｒ）,ψ∈Ｋ１（Ｒ）∩Ｌ３（Ｒ）时,上述问题存在唯一的整体光滑解。     

n次多项式系统不变直线条数的两个估计

该文将ｎ次多项式系统简称为Ｅｎ系统。该文证明了Ｅｎ系统当ｎ≥３时可存在Ｒｎ＝２ｎ＋１＋（－１）＾ｎ２条方向各异的不变直线及当ｎ≥２时至多存在ｎ组平行的不变直线；本文举例说明，当ｎ≥２时，Ｅｎ系统可以存在Ｓｎ＝２ｎ＋３＋（－１）＾ｎ＋１２条不变直线。提出了二个估计：（１）当ｎ≥２时，Ｅｎ系统至多存在Ｓｎ条不变直线，证明了ｎ＝２，３，４时这一估计是对的；（２）当ｎ≥３３时，Ｅｎ系统至多存在Ｒｎ条方向各     

一类沿曲面的奇异积分算子的（L^∞,BMO）—有界性

设ｎ≥３，定义Ｔｆ（ｘ，ｘｎ）＝Ｐ．Ｖ．∫Ｒ＾ｎ－１ｂ（ｔ）Ｋ（ｔ）ｆ（ｘ＝ｔ，ｘｎ－Г（│ｔ│））ｄｔ，其中ｘ∈Ｒ＾ｎ－１，ｂ（ｔ）为Ｒ＾ｎ－１上的有界函数，Ｋ（ｔ）为Ｒ＾ｎ－１上满足Ｈｏｒｍａｎｄｅｒ条件的函数，且Г（ｓ）为〔０，∞）上的任意函数。本文给出了Ｔ为（Ｌ∞（Ｒ＾ｎ），ＢＭＯ（Ｒ＾ｎ））一型，或等价地（Ｈ＾１（Ｒ＾ｎ），Ｌ＾１（Ｒ＾ｎ））一型时，ｂ所应满足的充分必要条件。     

关于类空W超曲面的一个存在性定理

利用超曲面的旋转对称性，将ＰＤＥ的求解转化为ＯＤＥ的求解，确定了Ｄｅ Ｓｉｔｔｅｒ空间中的一类旋转型的Ｗｅｉｎｇａｒｔｅｎ超曲面。即获得：给定Ｒ＾ｎ－１内开集（０，∞）＾ｎ－１上一个Ｃ＾１函数ｋｎ＝ｆ（ｋ１，…，ｋｎ－１）（ｎ≥２），一定存在Ｄｅ Ｓｉｔｔｅｒ空间Ｓ１＾ｎ＋１内的ｎ维类空旋转超曲面Ｍ，使得Ｍ的ｎ个主曲率ｋ１，…，ｋｎ恰有上述函数关系。     

高维常平均曲率超曲面的数量曲率的空隙

本文证明了当高维球面中闭常平均曲率超曲面Ｍ＾ｎ的平均曲率│Ｈ│＜Ｃ（ｎ）时，若Ｍ的数量曲率Ｒ为常数，则Ｒ不属于［ａ（ｎ，Ｈ），ａ（ｎ，Ｈ）＋ｎ／４），其中ａ（ｎ，Ｈ）＝ｎ（ｎ－９／４）＋ｎ＾２（ｎ－２）／２（ｎ－１）Ｈ＾２－ｎ（ｎ－２）／２（ｎ－１）√ｎ＾２Ｈ＾４＋４（ｎ－１）Ｈ＾２。     

强对称的自正交对角拉丁方

1 引言 一个ｎ阶拉丁方是含ｎ个相异元素的集合Ｎ上的一个ｎ阶方阵，其每一行和每一列都是Ｎ的一个置换．ｎ阶拉丁方的一条截态是位于不同行不同列的ｎ个位置使得其中的ｎ个元素两两相异．ｎ阶对角拉丁方是一个ｎ阶拉丁方，其主对角线（位置（）与反对角线（位置（）均为截态． 两个ｎ阶拉丁方Ａ和Ｂ称为正交的（简记作Ａ上Ｂ），如果把它们迭合在一起时，拉丁方Ａ的每一个记号与拉丁方Ｂ的每一个记号相遇一次且仅相遇一次．如果一个ｎ阶拉丁方Ｌ和它自己的转置正交，则称Ｌ为一个自正交的拉丁方，简记为ＳＯＬＳ（ｎ）． ｎ阶自正交对角拉…     

非线性波动方程整体解存在的一个必要条件

该文给出了非线性波动方程ｕｎ＝△ｕ＋ｆ（ｕ），（ｆ（ｕ）＝ｕ＾ｐ，ｐ〉１）的Ｃａｕｃｈｙ问题在函数空间Ｃ＾ｋ０（Ｒ＾ｎ）的原点领域有古典整体解的一个必要条件：１／２（ｕ（０）＾２Ｌ２＋ｕｔ（０）＾２Ｌ２）－∫Ｒ＾ｎ∫＾ｕ００ｆ（ｓ）ｄｓｄｘ≤０，并且证明了１〈ｐ〈＾ｎ＾２＋ｎ＋２／ｎ（ｎ－１），ｎ≠１（ｎ＝１，１〈ｐ〈＋∞）古典解与广义解有相同的生命跨度，同时给出了生命跨度的上界估计。     

关于Szasz—Kantorovich算子的强逆不等式

本文对Ｓｚａｓｚ－Ｋａｎｔｏｒｏｖｉｃｈ算子Ｓｎ＾＊（ｆ，ｘ）证明了，当１〈ｐ≤∝时存在某一正整数ｍ，使得ｗψ＾２（ｆ；１／√ｎ）ｐ≤Ｍ（‖Ｓｎ＾＊（ｆ，ｘ）－ｆ‖ｐ＋‖Ｓｍｍ＾＊（ｆ，ｘ）－ｆ‖ｐ），ψ（ｘ）＾２＝ｘ，Ｍ〉０，ｗψ＾（ｆ，ｔ）ｐ为Ｄｉｔｚａｉｎ和Ｔｏｔｉｋ光滑模〔２〕。     

De Sitter空间中具有常均曲率的类空超曲面（Ⅱ）

设Ｍ＾ｎ是Ｄｅ Ｓｉｔｔｅｒ空间Ｓ１＾ｎ＋１中具有常数平均曲率且第二基本形式长度的平方为常数的完备类空超曲面，若Ｓ≤２（ｎ－１）＾１／２，则Ｍ＾ｎ是等参超曲面。     

关于容差设计

本文提出用参数设计和容差设计同时完成的新方法扩大产品原器件的容差，来改进生产。     

Superpure digraph designs

A digraph design is a decomposition of a complete (symmetric) digraph into copies of pre‐specified digraphs. Well‐known examples for digraph designs are Mendelsohn designs, directed designs or orthogonal directed covers. A digraph design is superpure if any two of the subdigraphs in the decomposition have no more than two vertices in common. We give an asymptotic existence theorem for superpure digraph designs, which is a variation of an earlier result of Lamken and Wilson J Combin Theory Ser A 89: 149–200, 2000. As an immediate consequence, we obtain new results for supersimple designs and pure perfect Mendelsohn designs. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 239–255, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10013     

On the connectedness of partially balanced block designs

The necessary and sufficient conditions for m-associate partially balanced block (PBB) designs to be connected are given. This generalizes the criterion for m-associate partially balanced incomplete block (PBIB) designs, which has originally been established by Ogawa, Ikeda and Kageyama (1984, Proceedings of the Seminar on Combinatorics and Applications, 248–255, Statistical Publishing Society, Calcutta).This work was partially supported by the Polish Academy of Sciences Grant No. MR I.1-2/2.     

Pseudo generalized Youden designs

Youden square designs, or Youden rectangles, are classical objects in design theory. Extensions of these were introduced in 1958 by Kiefer and in 1981 by Cheng, in the form of generalized Youden designs (GYDs) and pseudo Youden designs (PYDs), respectively. In this paper, we introduce a common generalization of both these objects, which we call a pseudo generalized Youden design (PGYD). PGYDs share the statistically desirable optimality properties of GYDs and PYDs, and we show that they exist in situations where neither GYDs nor PYDs do. We determine some numerical necessary conditions for the existence of PGYDs, classify their existence for small parameter sets, and provide constructions for families of PGYDs using patchwork methods based on affine planes.     

混料切片试验设计

混料试验设计在众多领域中都有广泛的应用,有时试验者不仅仅需要考虑各混料成分所占比例对响应变量的影响,同时还关心其它被称为过程变量的因素.在实际中,对于这类问题通常使用的设计方案是混料设计和因子设计的组合设计.这种组合设计在过程变量的不同水平组合下,使用的是相同的设计阵,因此空间填充性较差.基于混料球体堆积设计,文章提出了一类新的混料设计,称之为混料切片设计,它的整体设计和所有子设计(过程变量的每一水平组合对应的混料设计)都具有很好的空间填充性,从而比组合设计有更好的模型稳健性.基于同余子群的陪集分解方法,针对过程变量水平组合数的不同情况提出了相应的简单快速的构造算法,文章最后的数值例子解释了算法的可行性和设计的有效性.     

一个六点九边图的图设计

令Kv表示v个顶点的完全图,G是一个不含孤立点的简单连通图.一个v阶的G-设计是将Kv划分成互不相交的子图,使得每个子图都和G同构,记为G-GD(v).研究六点九边图G11的图设计存在性问题.利用标准的递推构造并结合必要的直接构造,证明除去G11-GD(9)不存在以及G11-GD(18)的存在性未知外,G11-GD(v...     

Point-weight designs with design conditions on t points

This paper examines some of the properties of point-weight incidence structures, i.e. incidence structures for which every point is assigned a positive integer weight. In particular it examines point-weight designs with a design condition that stipulates that any two “identical” sets of t points must lie on the same number of blocks. We introduce a new class of designs with this property: row-sum designs, and examine the basic properties of row-sum point-weight designs and their similarities to classical (non-point-weight) designs and the point-weight designs of Horne [On point-weighted designs, Ph.D. Thesis, Royal Holloway, University of London, 1996].     

Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five

Each parallel class of a uniformly resolvable design (URD) contains blocks of only one block size k (denoted k-pc). The number of k-pcs is denoted r_k. The necessary conditions for URDs with v points, index one, blocks of size 3 and 5, and r₃,r₅>0, are . If r_k>1, then v≥k², and r₃=(v−1−4⋅r₅)/2. For r₅=1 these URDs are known as group divisible designs. We prove that these necessary conditions are sufficient for r₅=3 except possibly v=105, and for r₅=2,4,5 with possible exceptions (v=105,165,285,345) New labeled frames and labeled URDs, which give new URDs as ingredient designs for recursive constructions, are the key in the proofs.     

Ternary codes,biplanes, and the nonexistence of some quasisymmetric and quasi‐3 designs

The dual codes of the ternary linear codes of the residual designs of biplanes on 56 points are used to prove the nonexistence of quasisymmetric 2‐ $\left(56,12,9\right)$ and 2‐ $\left(57,12,11\right)$ designs with intersection numbers 0 and 3, and the nonexistence of a 2‐ $\left(267,57,12\right)$ quasi‐3 design. The nonexistence of a 2‐ $\left(149,37,9\right)$ quasi‐3 design is also proved.