首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 203 毫秒
1.
2.
3.
4.
n (D) — ,s n (D), v (v=1, 2, ...,s/2) — . m={0x 0<x 1<...<x 2m–1<2,x 2m =x 0+2} , x j +1–x j <(4s max v )–1,j=0, 1, ..., 2m –1, ( ) 2- - n,m 2m , m . , L q - (1q) W ( n )={f 2 :f (n–1)AC 2 , n (D)f 1} 2- - (s n f), m . , - - n,m .

The author expresses his gratitude to Yu. N. Subbotin for a useful discussion on the results of this paper.  相似文献   

5.
6.
. : [0, +) [0, +) - , u+ (u) (u)=o(u lnu). [0, 1]2 f , ¦f¦ L([0, 1]2), - [0, 1]2.  相似文献   

7.
8.
, , . . . [1], , . , , ., , L logL. , , . . . . [5]. , .  相似文献   

9.
10.
11.
12.
(, ) — R m ×R n . f R m ×R n fp,q, f L p (R m) x y, Lq(Rn). ׃ q,r cƒ p,r , ׃ R m ×R n , , , q r . , ( ¦¦) K 0 (y); p, g r , K 0.  相似文献   

13.
The weighted matroid intersection problem has recently been extended to the valuated matroid intersection problem: Given a pair of valuated matroidsM i = (V, i , i ) (i = 1,2) defined on a common ground setV, find a common baseB 1 2 that maximizes 1 (B) + 2 (B). This paper develops a Fenchel-type duality theory related to this problem with a view to establishing a convexity framework for nonlinear integer programming. A Fenchel-type min max theorem and a discrete separation theorem are given. Furthermore, the subdifferentials of matroid valuations are investigated. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Part of this paper has been presented at fifth SIAM Conference on Optimization, Victoria, May 1996.This work was done while the author was at Forschungsinstitut für Diskrete Mathematik, Universität Bonn, 1994–1995.  相似文献   

14.
R n. , , , F R n, F , R n R n . p,q (Rn), >0, 1, q, — ( ) Rn. , p,q (Rn) F Rn. , q B p,q (F), = – (n–)/, >0, — « », adF, . , . : , F=R d,F— « » FR n, « », F. .

This work has been supported in part by the Swedish Natural Science Research Council.  相似文献   

15.
16.
LetB,B be bases of a matroid, withX B, X B. SetsX,X are asymmetric exchange if(B – X) X and(B – X) X are bases. SetsX,X are astrong serial B-exchange if there is a bijectionf: X X, where for any ordering of the elements ofX, sayx i ,i = 1, , m, bases are formed by the sets B0 = B, Bi = (Bi–1 – xi) f(x i), fori = 1, , m. Any symmetric exchangeX,X can be decomposed by partitioning X = i=1 m Yi, X = i=1 m Yi, X, where (1) bases are formed by the setsB 0 =B, B i = (B i–1 Y i ) Y i ; (2) setsY i ,Y i are a strong serialB i–1 -exchange; (3) properties analogous to (1) and (2) hold for baseB and setsY i ,Y i .  相似文献   

17.
, a n f n (x) . .  相似文献   

18.
19.
The problem of homogenization is considered for an elastic body occupying a perforated domain = obtained from a fixed domain and an -contraction of a 1-periodic domain .  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号