首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 109 毫秒
1.
The fundamental result: if and v are two finite Borel measures, defined in the spaceL p[0, 1] (1p<) or in C(K) (K is a metric compactum without isolated points), then from the equalities (B)=v(B) for all balls B of radius 1 there follows that =v. In addition, in the spaces C(K) and p (1p<) from the inequalities (B) v(B) there follows that v.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 177, pp. 122–128, 1989.  相似文献   

2.
Summary For allm 19 and each meaningful value ofi (2 i m/2), the spectrum problem fori-perfectm-cycle systems is examined.  相似文献   

3.
We consider the (&, )-fragment of the intuitionistic propositional calculus. It is proved that under the standard transformation of a Gentzen derivation into a natural derivation(), the length of (())22·length( ). There is constructed a sequence of Gentzen derivations of length i, for which the length of (( i))21/3·length(i), which shows that the upper bound obtained is not too weak.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 192–196, 1979.  相似文献   

4.
Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = maxgG| g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .  相似文献   

5.
Fors2, the set of iterated differences associated with the prescribed integersa(s, j), 1js, is the set {a(i, j): 1jis} wherea(i–1,j)=|a(i, j)–a(i, j+1)|, general problem raised by work of Kreweras and Loeb concerns the existence of partitions of runs of consecutive integers into full sets of iterated differences. In the regular case, where all the sets of iterated differences have the same valencys, it is known that such partitions do not exist at least fors>8. We find here that the problem is more challenging in the case where the sets have different valencies.  相似文献   

6.
Let n be n-dimensional Euclidean space, and let : [0, L] n and : [0, L] n be closed rectifiable arcs in n of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C 2 curves. In this paper we prove the conjecture in general.  相似文献   

7.
Two finite real sequences (a 1,...,a k ) and (b 1,...,b k ) are cross-monotone if each is nondecreasing anda i+1a i b i+1b i for alli. A sequence (1,..., n ) of nondecreasing reals is in class CM(k) if it has disjointk-term subsequences that are cross-monotone. The paper shows thatf(k), the smallestn such that every nondecreasing (1,..., n ) is in CM(k), is bounded between aboutk 2/4 andk 2/2. It also shows thatg(k), the smallestn for which all (1,..., n ) are in CM(k)and eithera k b 1 orb k a 1, equalsk(k–1)+2, and thath(k), the smallestn for which all (1,..., n ) are in CM(k)and eithera 1b 1...a k b k orb 1a 1...b k a k , equals 2(k–1)2+2.The results forf andg rely on new theorems for regular patterns in (0, 1)-matrices that are of interest in their own right. An example is: Every upper-triangulark 2×k 2 (0, 1)-matrix has eitherk 1's in consecutive columns, each below its predecessor, ork 0's in consecutive rows, each to the right of its predecessor, and the same conclusion is false whenk 2 is replaced byk 2–1.  相似文献   

8.
Consider a min-max problem in the form of min xX max1im {f i (x)}. It is well-known that the non-differentiability of the max functionF(x) max1im {f i (x)} presents difficulty in finding an optimal solution. An entropic regularization procedure provides a smooth approximationF p(x) that uniformly converges toF(x) overX with a difference bounded by ln(m)/p, forp > 0. In this way, withp being sufficiently large, minimizing the smooth functionF p(x) overX provides a very accurate solution to the min-max problem. The same procedure can be applied to solve systems of inequalities, linear programming problems, and constrained min-max problems.This research work was supported in part by the 1995 NCSC-Cray Research Grant and the National Textile Center Research Grant S95-2.  相似文献   

9.
Suppose M is a complete noncompact surface C2 immersed in E3 with K 0. It is proved that M is a cylinder if H 2 for some > 0. Moreover, the pinching constant 2 is optimal.  相似文献   

10.
Summary We prove a variational inequality linking the values of the free energy per site at different temperatures. This inequality is based on the Legendre transform of the free energy of two replicas of the system. We prove that equality holds when1/ and fails when 1/ <1. We deduce from this that the mean entropy per site of the uniform distribution with respect to the distribution of the coupling i 1 i 2 = i between two replicas is null when 01/ and strictly positive when 1/ <1. We exhibit thus a new secondary critical phenomenon within the high temperature region 01. We given an interpretation of this phenomenon showing that the fluctuations of the law of the coupling with the interactions remains strong in the thermodynamic limit when>1/ . We also use our inequality numerically within the low temperature region to improve (slightly) the best previously known lower bounds for the free energy and the ground state energy per site.  相似文献   

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

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