首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] b a [1 + (p(x)) 2]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.  相似文献   

2.
Weyl's theorem for operator matrices   总被引:11,自引:0,他引:11  
Weyl's theorem holds for an operator when the complement in the spectrum of the Weyl spectrum coincides with the isolated points of the spectrum which are eigenvalues of finite multiplicity. By comparison Browder's theorem holds for an operator when the complement in the spectrum of the Weyl spectrum coincides with Riesz points. Weyl's theorem and Browder's theorem are liable to fail for 2×2 operator matrices. In this paper we explore how Weyl's theorem and Browder's theorem survive for 2×2 operator matrices on the Hilbert space.Supported in part by BSRI-97-1420 and KOSEF 94-0701-02-01-3.  相似文献   

3.
Let be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition with block size v. Let be the quotient graph of relative to and [B,C] the bipartite subgraph of induced by adjacent blocks B,C of . In this paper we study such graphs for which is connected, (G, 2)-arc transitive and is almost covered by in the sense that [B,C] is a matching of v-1 2 edges. Such graphs arose as a natural extremal case in a previous study by the author with Li and Praeger. The case K v+1 is covered by results of Gardiner and Praeger. We consider here the general case where K v+1, and prove that, for some even integer n 4, is a near n-gonal graph with respect to a certain G-orbit on n-cycles of . Moreover, we prove that every (G, 2)-arc transitive near n-gonal graph with respect to a G-orbit on n-cycles arises as a quotient of a graph with these properties. (A near n-gonal graph is a connected graph of girth at least 4 together with a set of n-cycles of such that each 2-arc of is contained in a unique member of .)  相似文献   

4.
We consider the complexes of Hilbert spaces whose differentials are closed densely-defined operators. A peculiarity of these complexes is that from their differentials we can construct Laplace operators in every dimension. The Laplace operator together with a sufficiently nice measurable function enables us to define a generalized Sobolev space. There exist pairs of measurable functions allowing us to construct some canonical mappings of the corresponding Sobolev spaces. We find necessary and sufficient conditions for those mappings to be compact. In some cases for a given Hilbert complex we can construct an associated Sobolev complex. We show that the differentials of the original complex are normally solvable simultaneously with the differentials of the associated complex and that the reduced cohomologies of these complexes coincide.  相似文献   

5.
Let f: XY be a nonlinear differentiable map, X,Y are Hilbert spaces, B(a,r) is a ball in X with a center a and radius r. Suppose f (x) is Lipschitz in B(a,r) with Lipschitz constant L and f (a) is a surjection: f (a)X=Y; this implies the existence of >0 such that f (a)* yy, yY. Then, if r,/(2L), the image F=f(B(a,)) of the ball B(a,) is convex. This result has numerous applications in optimization and control. First, duality theory holds for nonconvex mathematical programming problems with extra constraint xa. Special effective algorithms for such optimization problems can be constructed as well. Second, the reachability set for small power control is convex. This leads to various results in optimal control.  相似文献   

6.
An abelian topological group is an group if and only if it is a locally -compactk-space and every compact subset in it is contained in a compactly generated locally compact subgroup. Every abelian groupG is topologically isomorphic to G 0 where 0 andG 0 is an abelian group where every compact subset is contained in a compact subgroup. Intrinsic definitions of measures, convolution of measures, measure algebra,L 1-algebra, Fourier transforms of abelian groups are given and their properties are studied.  相似文献   

7.
Let {X t} t0 be a Feller process generated by a pseudo-differential operator whose symbol satisfiesÇn|q(Ç,)|c(1=)()) for some fixed continuous negative definite function (). The Hausdorff dimension of the set {X t:tE}, E [0, 1] is any analytic set, is a.s. bounded above by dim E. is the Blumenthal–Getoor upper index of the Levy Process associated with ().  相似文献   

8.
Two-parameter Vilenkin systems will be investigated. First we give a general sufficient condition for multipliers to be bounded between two-dimensional Hardy spaces H q(0<q1). By means of interpolation and duality argument, this theorem can be extended to other spaces. As a consequence, we can prove the (H q , L q)-boundedness of the Sunouchi operator U with respect to two-parameter Vilenkin systems for all 0 <q 1. Moreover, the equivalence f{Hq} ~ Ufq (f Hq)follows for 1/2<q 1.  相似文献   

9.
Let (, A, ) be a measure space, a function seminorm on M, the space of measurable functions on , and M the space {f M : (f) < }. Every Borel measurable function : [0, ) [0, ) induces a function : M M by (f)(x) = (|f(x)|). We introduce the concepts of -factor and -invariant space. If is a -subadditive seminorm function, we give, under suitable conditions over , necessary and sufficient conditions in order that M be invariant and prove the existence of -factors for . We also give a characterization of the best -factor for a -subadditive function seminorm when is -finite. All these results generalize those about multiplicativity factors for function seminorms proved earlier.  相似文献   

10.
Let be a fixed point free group given by the presentation where and are relative prime numbers, t = /s and s = gcd( – 1,), and is the order of modulo . We prove that if (1) = 2, and (2) is embeddable into the multiplicative group of some skew field, then is circular. This means that there is some additive group N on which acts fixed point freely, and |((a)+b)((c)+d)| 2 whenever a,b,c,d N, a0c, are such that (a)+b(c)+d.  相似文献   

11.
p- . E R n -, f () p(R n)., ER n 2nq 0, E— - q 0(q 0-1). : q0>2 n1 E R n 2nq 0, p- p<0. , f-[-, ]n, f A p(R n) , p([-, ]n) (1 << ).  相似文献   

12.
We prove that if aC 1 smooth change of variable : generates a bounded composition operatorff° in the spaceA p()=L p ,p2, then is linear (affine).We also prove that for a nonlinearC 1 mapping , the norms of exponentialse i as Fourier multipliers inL p () tend to infinity (,||). In both results the condition C 1 is sharp, it cannot be replaced by the Lipschitz condition.  相似文献   

13.
A permutation set (M, I) consisting of a setM and a set of permutations ofM, is calledsymmetric, if for any two permutations, the existence of anx M with (x) (x) and –1 (x) = –1 (x) implies –1 = –1 , andsharply 3-transitive, if for any two triples (x 1,x 2,x 3), (y 1,y 2,y 3) M 3 with|{x 1,x 2,x 3 }| = |{y 1,y 2,y 3 }| = 3 there is exactly one permutation with(x 1) =y 1,(x 2) =y 2,(x 3) =y 3. The following theorem will be proved.THEOREM.Let (M, ) be a sharply 3-transitive symmetric permutation set with |M|3, such that contains the identity. Then is a group and there is a commutative field K such that and the projective linear group PGL(2, K) are isomorphic.  相似文献   

14.
A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.  相似文献   

15.
Summary Let G be a sharply 3-transitive permutation set on a finite set E of even cardinality and let 1 be in G. The following theorems are proved. G is one of the known examples if and only if there exists a non-identity normal subgroup N of G and an element of E such that NG G.G is a group if and only if G for every G and for every G and for every G .By using the classification of finite single groups a result concerning sharply k-transitive permutation sets k>3 is also proved.

Dedicato a Guido Zappa in occasione del suo 70° compleanno

Lavoro eseguito nell'ambito dei progetti finanziati dal Ministero della Pubblica Istruzione.  相似文献   

16.
Summary This paper is concerned with the rate of convergence to zero of theL pmetrics np1p, constructed out of differences between distribution functions, for departure from normality for normed sums of independent and identically distributed random variables with zero mean and unit variance. It is shown that the np are, under broad conditions, asymptotically equivalent in the strong sense that, for 1p, p, np/np is universally bounded away from zero and infinity asn.  相似文献   

17.
f(x,y) 0BV(T2), ={1/n} n=1 .

Dedicated to Professor Károly Tandori, the outstanding mathematician and academician on his seventieth birthday

This work was done under the financial support of the Russian Foundation for Fundamental Scientific Research, Grant 93-01-00240.  相似文献   

18.
This paper deals with linear systems of difference equations whose coefficients admit generalized factorial series representations atz=. We are concerned with the behavior of solutions near the pointz= (the only fixed singularity for difference equations). It is important to know whether a system of linear difference equations has a regular singularity or an irregular singularity. To a given system () we can assign a number , called the Moser's invariant of (), so that the system is regular singular if and only if 1. We shall develop an algorithm, implementable in a computer algebra system, which reduces in a finite number of steps the system of difference equations to an irreducible form. The computation ot the number can be done explicitly from this irreducible form.  相似文献   

19.
Let A be a set of positive integers with gcd (A) = 1, and let p A (n) be the partition function of A. Let c 0 = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p A (n)/c 0 n and lim sup log p A (n)/c 0 n . In particular, if A has asymptotic density > 0, then log p A (n) c0n. Conversely, if > 0 and log p A (n) c 0 n, then the set A has asymptotic density .  相似文献   

20.
f(x,y) jk . , {c jk} , f(x, )(, ) [0,1)&#x0445;[0,1) , - (0,0). , , f, - f. , , , [1] . . - [5] [6].

This research is supported by National Science Council, Taipei, R.O.C. under Grant #NSC 84-2121-M-007-026.  相似文献   

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

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