Whc134的解决

文［１］中提出的第１３４个问题是：当ｋ取某个大于１的值时,是否存在某类三角形,使　ａ２＋ｂ２＋ｃ２≥４３△＋ｋ［（ａ－ｂ）２＋（ｂ－ｃ）２＋（ｃ－ａ）２］（１）仍成立？ｋ取任何正值都有相应的三角形使不等式成立吗？事实上,当ｋ≥３时,由ａ２＋ｂ２＋ｃ２≤４３△＋３［（ａ－ｂ）２＋（ｂ－ｃ）２＋（ｃ－ａ）２］知除正三角形外,不存在任何别的三角形使（１）式成立;图１当１＜ｋ＜３时,除正三角形外,还存在等腰三角形和不等边三角形使（１）式成立．下面我们证明这个结论．证明　对任意△ＡＢＣ,以它的一条中线ＡＤ…     

关于一类S~（1，1）_3（△~（2）_（mn））插值与逼近

设△￣（２）＿（ｍｘ）是矩形域Ｄ＝［ａ，ｂ］［ｃ，ｄ］的Ⅱ－型三角剖分．Ｓ￣（１，１）＿３（△￣（２）＿（ｍｘ）是带边界条件的三元三次样条空间：本文我们将讨论一类Ｓ￣（１，１）＿３（△￣（２）＿（ｍｘ））的插值问题，证明了它的存在性，唯一性及逼近阶：如果ｆ∈Ｃ￣４（Ｄ），则有｜ｆ－ｓ｜≤ｋ（ｌ）．ｍａｘ（ρ△，ρ￣（－１）＿△）．‖ｆ‖．．ｈ￣２．     

ERDS-RE''''NYI大数律下自正则的效用

｛Ｘ，Ｘｉ，ｉ≥１｝是ｉ．ｉ．ｄ．ｒ．ｖ′．ｓ．在矩母函数存在的条件下，由古典的Ｅｒｄｏｓ－Ｒéｎｙｉ大数律有ｌｉｍｎ→∞ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ［ｃｌｏｇｎ］＝α（ｃ），α（ｃ）为某常数．自正则下ＭｉｋｌóｓＣｓｏｒｇｏ＆ＳｈａｏＱｉｍａｎ（１９９４）在仅要求一阶矩的条件下就得到了：ｌｉｍｎ→∞ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１（Ｘ２ｉ＋１）＝β（ｃ），β（ｃ）为某常数．众所周知，自正则下人们往往在较弱条件下取得相应结果是因为：分母中的Ｘ能有效抵销分子中Ｘ较大而引起整个分式极限行为的波动．因此，在什么样的条件下，式ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘ２ｉ１－β［ｃｌｏｇｎ］β→ｒ（ｃ）成为非常有意思的问题，因为它将依赖于β的大小．本文给出，当０＜β≤１２时，只要Ｅ（Ｘ）≥０，上式就有有限极限．当１２＜β＜１时，则必须在矩母函数存在下，上式才有有限极限．并都求出了其极限表达式．     

关于单叶函数和万有Teichmuller空间的一些注记

万有Ｔｅｉｃｈｍｕｌｌｅｒ空间Ｔ是所有规范的拟对称同胚组成的集合，在Ｂｅｒｓ嵌入下，Ｔ与△上共形映射的Ｓｃｈｗａｒｚ导数密切相关，本文讨论由规范的对称同胚所 子集Ｔ０的相应性质。     

无界域上Schrodinger型方程的指数吸引子

本文在［１］的基础上,证明了Ｓｃｈｒｏｄｉｎｇｅｒ型方程ｔｕ＝ （ｋ＋ ｉβ）△ｕ－ ｜ｕ｜ρｕ－ λｕ－ ｇ（ｘ）, ｕ（ｘ, ０）＝ ｕ０． 其中ｋ, ρ, λ＞ ０, ｘ∈Ｒｎ 在加权ｓｏｂｏｌｅｖ 空间中指数吸引子的存在性．     

关于Fibonacci三角形的又一结果

关于Ｆｉｂｏｎａｃｃｉ三角形的又一结果许康华（浙江省富阳中学３１１４００）陈计先生在文［１］中介绍了如下猜想：当１≤ｋ＜ｎ时，不存在以（Ｆｎ－ｋ，Ｆｎ，Ｆｎ）为边长的Ｆｉｂｏｎａｃｃｉ三角形．文［２］指出，要证明这个猜想，只需证明不存在以（Ｆ３ｍ，Ｆ...     

关于Poincar级数算子的范数的一个注记

设无挠Ｆｕｃｈｓ群Ｔ及其子群Г’对应的Ｐｏｉｎｃａｒ级数算子为，对于Г的Ｔｅｉｃｈｍｌｌｅｒ空间Ｔ（Г）中的任意一点［ｆ］，有相应的算子，其中Гｆ＝ｆГｆ－１，从而的范数，为Ｔ（Г）上的函数．众所周知．本文证明了在整个没有小于１的上界     

度量空间的k—映射像

Ｅ．Ｈａｌｆａｒ（［６］引入了ｋ－映射概念，本文给出了度量空间ｋ－映像的一个内在刻划，并由此得到一些度量化定理。     

Notes on Univalent Functions and the Universal Teichmüller Space

万有Ｔｅｉｃｈｍüｌｅｒ空间Ｔ是所有规范的拟对称同胚组成的集合．在Ｂｅｒｓ嵌入下，Ｔ与Δ上共形映射的Ｓｃｈｗａｒｚ导数密切相关．本文讨论由规范的对称同胚所组成的子集Ｔ０的相应性质．     

一个涉及六条角平分线的几何不等式

１９９４年,刘健在文献［１］中建立了以下一个几何不等式：（ｒ２ｒ３）ｋ＋（ｒ３ｒ１）ｋ＋（ｒ１ｒ２）ｋ≤１９ｋ（ｈ２ｋａ＋ｈ２ｋｂ＋ｈ２ｋｃ）①其中０＜ｋ≤１,ｒ１,ｒ２,ｒ３表示△ＡＢＣ内部任一点至三边的距离,ｈａ,ｈｂ,ｈｃ表示△ＡＢＣ的三高．特...     

On the extremal sets of extremal quasiconformal mappings

The properties of the extremal sets of extremal quasiconformal mappings are discussed. It is proved that if an extremal Beltrami coefficient μ(z) is not uniquely extremal, then there exists an extremal Beltrami coefficient v(z) in its equivalent class and a compact subset E Δ with positive measure such that the essential upper bound of v(z) on E is less than the norm of [μ].     

Disjoint unions of complete minors

Given integers r and s, and n large compared to r and s, we determine the maximum size of a graph of order n having no minor isomorphic to sK_r, the union of s disjoint copies of K_r.The extremal function depends on the relative sizes of r and s. If s is small compared to r the extremal function is essentially independent of s. On the other hand, if s is large compared to r, there is a unique extremal graph ; this assertion is a generalization of the case r=3 which is a classical result of Erd?s and Pósa.     

On characterizations of unique extremality

In this paper, we make some further considerations of the characteristic conditions of (infinitesimally) unique extremality for Beltrami coefficients obtained by Bozin et al., and find some sufficient conditions simpler in form for a Beltrami coefficient μ with nonconstant absolute value to be (infinitesimally) uniquely extremal.     

关于极面的ADJOINT收缩

高维代数簇的半线收缩已具有很多研究。将它们推广到极面收缩对高维簇的双有理分类理论是很有意义的。设X是非奇异的n维射影簇,L是X上的ample除子,f:X→Y是以Kx(n-3)L为支撑除子的极面收缩映射。当f不是双有理映射,Belktrametti等人系统的研究了f的结构。本文主要研究f是双有理映射时的情形。一个完整的结构定理被给出。     

New Extremal Type I Codes of Lengths 40, 42, and 44

It is known that it is possible to construct a generator matrix for a self-dual code of length 2n+2 from a generator matrix of a self-dual code of length 2n. With the aid of a computer, we construct new extremal Type I codes of lengths 40, 42, and 44 from extremal self-dual codes of lengths 38, 40, and 42 respectively. Among them are seven extremal Type I codes of length 44 whose weight enumerator is 1+224y ⁸+872y ¹⁰+·. A Type I code of length 44 with this weight enumerator was not known to exist previously.     

Vectors of minimal norm

We characterize the minimal vectors (or extremal vectors) for the operator of multiplication by on We then give an application to infinite systems of equations.

     

A weighted generalization of Turán's theorem

We obtain a generalization of Turáns theorem for graphs whose edges are assigned integer weights. We also characterize the extremal graphs in certain cases. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 267–275, 1997     

Four‐cycles in graphs without a given even cycle

We prove that every bipartite C_2l‐free graph G contains a C₄‐free subgraph H with e(H) ≥ e(G)/(l – 1). The factor 1/(l – 1) is best possible. This implies that ex(n, C_2l) ≤ 2(l – 1)ex(n, {C₄, C_2l}), which settles a special case of a conjecture of Erd?s and Simonovits. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 147–156, 2005     

Nontrivial Critical Networks. Singularities of Lagrangians and a Criterion for Criticality

We single out the class of so-called quasiregular Lagrangians, which have singularities on the zero section of the cotangent bundle to the manifold on which extremal networks are considered. A criterion for a network to be extremal is proved for such Lagrangians: the Euler--Lagrange equations must be satisfied on each edge, and some matching conditions must be valid at the vertices.