首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
For a solution u of –u=u(1–|u|2) on the whole plane, |u|<1 holds everywhere unless u=ei for some ; the derivatives of order k have moduli a constant M kdepending only on k. For a solution u on an open set 2, the moduli of u and its derivatives have upper bounds depending only on the distance to 2\ therefore the set of solutions on a given is compact in C() for the topology of uniform convergence on compact subsets of . For a solution u such that |u|<1, 1–|u| satisfies an estimation similar to the classical Harnack inequality for positive harmonic functions.Finally, if is bounded and |u| has a lim supm at each boundary point, the |u|m in if m1, but if m<1 then |u| admits only a majorant S m with values in ]m, 1[ and sufficient conditions are given for lim S m =0 or S m =O(m) as m0.
  相似文献   

2.
We consider an evolution process in a Gaussian random field V(q) with the mean ‹V(q)› = 0 and the correlation function W(|qq|) ‹V(q)V(q)›, where q d and d is the dimension of the Euclidean space d . For the value ‹G(q,t;q 0)›, t > 0, of the Green's function of the evolution equation averaged over all realizations of the random field, we use the Feynman–Kac formula to establish an integral equation that is invariant with respect to a continuous renormalization group. This invariance property allows using the renormalization group method to find an asymptotic expression for ‹G(q,t;q 0)› as |qq 0| and t .  相似文献   

3.
Summary For piecewise linear Ritz approximation of second order elliptic Dirichlet problemsAu=f over domains n globalL error boundsO(h 2|lnh|v) are obtained under the assumptionfL (). The proof rests on interpolation ofH 2()-functions with second derivatives in the space of John and Nirenberg by piecewise linear splines and a technique of Nitsche [7] using weighted Sobolev norms.

Diese Note wurde verfaßt mit der Unterstützung des Sonderforschungsbereiches 72 der DFG, Bundesrepublik Deutschland  相似文献   

4.
In this paper, we study the asymptotics of the spectrum of the Dirichlet (or Neumann) Laplacian in a bounded open set R n (n 1) with irregular but nonfractal boundary. We give a partial resolution of the Weyl conjecture, i.e. for the counting functionN i ()(i=0 : Dirichlet;i=1 : Neumann), we have got a precise estimate of the remainder term÷ i ()=() –N i () for large, where() is the Weyl term. This implies that for the irregular but nonfractal drum , not only the volume || n is spectral invariant but also the area of boundary || n–1 might be spectral invariant as well.Partially supported by the National Natural Science Foundation of China and the Grant of Chinese State Education Committee.  相似文献   

5.
We define the Möbius power series throughf(z)= n-1 z n ,g(z)= n=1 (n)z n /n where (n) is the usual Möbius function. This paper presents some heuristic estimates describing the behavior off(z) andg(z) when |z| is close to 1 together with representations in terms of elementary functions for real values ofz. Function tables are also given together with zeros and a few other special values.  相似文献   

6.
We shall give a further application of Hermite-Mahler polynomials to the consideration ofp-adic exponential function. An effective lower bound is obtained for max {| – | p ,P(e )| p }, where is an algebraic number satisfying || p <p –/(p–1), and 0 is ap-adic number with | | p depending on the degree of the polynomialPZ[y]. The bound obtained implies the transcendence ofe if ap-adic number satisfying 0 < || p <p –/(p–1) is algebraic or can be well approximated by algebraic numbers.This work was carried out while the author was a research fellow of the Alexander von Humboldt Foundation.  相似文献   

7.
Theendomorphism spectrum of an ordered setP, spec(P)={|f(P)|:f End(P)} andspectrum number, sp(P)=max(spec(P)\{|P|}) are introduced. It is shown that |P|>(1/2)n(n – 1) n – 1 implies spec(P) = {1, 2, ...,n} and that if a projective plane of ordern exists, then there is an ordered setP of size 2n 2+2n+2 with spec(P)={1, 2, ..., 2n+2, 2n+4}. Lettingh(n)=max{|P|: sp(P)n}, it follows thatc 1 n 2h(n)c 2 n n+1 for somec 1 andc 2. The lower bound disproves the conjecture thath(n)2n. It is shown that if |P| – 1 spec(P) thenP has a retract of size |P| – 1 but that for all there is a bipartite ordered set with spec(P) = {|P| – 2, |P| – 4, ...} which has no proper retract of size|P| – . The case of reflexive graphs is also treated.Partially supported by a grant from the NSERC.Partially supported by a grant from the NSERC.  相似文献   

8.
Let D=(V,E) be a minimally k-edge-connected simple directed graph. We prove that there is a function f(k) such that |V|f(k) implies |E|2k(|V|–k). We also determine the extremal graphs whose size attains this upper bound.Basic Research in Computer Science, funded by the Danish National Research Foundation.Supported by the MTA-ELTE Egerváry Research Group on Combinatorial Optimization, and the Hungarian Scientific Research Fund grant No. F034930, T037547, and FKFP grant No. 0143/2001. Part of this research was done when the second author visited BRICS, University of Aarhus, Denmark.  相似文献   

9.
In this paper three Banach spacesA 0(),A andA 1() of functions holomorphic in the unit ballB of n are defined. We exhibit bounded projections fromC 0(B) ontoA 0(), fromL 1(B) ontoA 1(), and fromL(B) ontoA(). Using these projections, we show thatA 0()* A 1() andA 1()* A().Supported in part by the National Natural Science Foundation of China.  相似文献   

10.
Let be a bounded domain in #x211D;n with a smooth boundary . In this work we study the existence of solutions for the following boundary value problem:
where M is a C 1-function such that M() 0 > 0 for every 0 and f(y) = |y| y for 0.  相似文献   

11.
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 .  相似文献   

12.
We address the problem of finding a minimum weight baseB of a matroid when, in addition, each element of the matroid is colored with one ofm colors and there are upper and lower bound restrictions on the number of elements ofB with colori, fori = 1, 2,,m. This problem is a special case of matroid intersection. We present an algorithm that exploits the special structure, and we apply it to two optimization problems on graphs. When applied to the weighted bipartite matching problem, our algorithm has complexity O(|EV|+|V| 2log|V|). HereV denotes the node set of the underlying bipartite graph, andE denotes its edge set. The second application is defined on a general connected graphG = (V,E) whose edges have a weight and a color. One seeks a minimum weight spanning tree with upper and lower bound restrictions on the number of edges with colori in the tree, for eachi. Our algorithm for this problem has complexity O(|EV|+m 2 |V|+ m|V| 2). A special case of this constrained spanning tree problem occurs whenV * is a set of pairwise nonadjacent nodes ofG. One must find a minimum weight spanning tree with upper and lower bound restrictions on the degree of each node ofV *. Then the complexity of our algorithm is O(|VE|+|V * V| 2). Finally, we discuss a new relaxation of the traveling salesman problem.This report was supported in part by NSF grant ECS 8601660.  相似文献   

13.
We investigate the asymptotic behaviour of the summatory functions of z(n, ), k(n, ) z (n) and k(n, ) z (n).  相似文献   

14.
Milner  E. C.  Pouzet  M. 《Order》1985,1(3):249-257
A topological graph is a graph G=(V, E) on a topological space V such that the edge set E is a closed subset of the product space V x V. If the graph contains no infinite independent set then, by a well-known theorem of Erdös, Dushnik and Miller, for any infinite set LV, there is a subset LL of the same oardinality |L| = |L| such that the restriction G L is a complete graph. We investigate the question of whether the same conclusion holds if we weaken the hypothesis and assume only that some dense subset AV does not contain an infinite independent set. If the cofinality cf (|L|)>|A|, then there is an L as before, but if cf (|L|)<-|A|, then some additional hypothesis seems to be required. We prove that, if the graph GA is a comparability graph and A is a dense subset, then for any set LV such that cf (|L|)>, there is a subset LL of size |L|=|L| such that GL is complete. The condition cf (|L|)> is needed.Research supported by NSERC grant #A5198.  相似文献   

15.
Summary LetC (t) be the Wiener sausage of radius inR d up to timet. We obtain bounds on the asymptotics ofE exp (|C (t)|) ast, for all >0.  相似文献   

16.
We show that the maximum number of edges boundingm faces in an arrangement ofn line segments in the plane isO(m 2/3 n 2/3+n(n)+nlogm). This improves a previous upper bound of Edelsbrunner et al. [5] and almost matches the best known lower bound which is (m 2/3 n 2/3+n(n)). In addition, we show that the number of edges bounding anym faces in an arrangement ofn line segments with a total oft intersecting pairs isO(m 2/3 t 1/3+n(t/n)+nmin{logm,logt/n}), almost matching the lower bound of (m 2/3 t 1/3+n(t/n)) demonstrated in this paper.Work on this paper by the first and fourth authors has been partially supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grants DCR-83-20085 and CCR-89-01484. Work by the first author has also been supported by an AT&T Bell Laboratories Ph.D. scholarship at New York University and by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center (NSF-STC88-09648). Work by the second author has been supported by NSF under Grants CCR-87-14565 and CCR-89-21421. Work by the fourth author has additionally been supported by grants from the U.S.-Israeli Binational Science Foundation, the NCRD (the Israeli National Council for Research and Development) and the Fund for Basic Research in Electronics, Computers and Communication, administered by the Israeli National Academy of Sciences.  相似文献   

17.
Let be a domain of the Euclidean space R m sent onto itself by a finite group G of congruences. In this paper we first define M elementary restriction matrices related to the group G and to a system of irreducible matrix representations of G. We then describe a general procedure to generate M restriction matrices for any finite-dimensional space V() of real functions defined on , when V() is invariant with respect to G. The number M depends only on the group G. Restriction matrices for the space V() have a block structure and all blocks can be obtained as from an elementary restriction matrix. Restriction matrices related to V() define a decomposition of V() as the sum of M subspaces. Finally, owing to restriction matrices, we propose a result of decomposition for linear systems. Several examples are presented.This revised version was published online in October 2005 with corrections to the Cover Date.  相似文献   

18.
Let be a bounded domain in Cn and let L2h() be the L2-holomorphic functions on . We show that the envelope of holomorphy and the L2h()-envelope of holomorphy of differ by at most a pluripolar set.Mathematics Subject Classification (2000): 32D10, 32A36, 32U30This article is based on work the author did during his Ph.D. studies at the University of Michigan under the supervision of John Erik Fornæss.  相似文献   

19.
Summary We consider a (possibly) vector-valued function u: RN, Rn, minimizing the integral , 2-2/(n*1)<p<2, whereD i u=u/x i or some more general functional retaining the same behaviour, we prove higher integrability for Du: D1 u,..., Dn–1 u Lp/(p-1) and Dnu L2; this result allows us to get existence of second weak derivatives: D(D1 u),...,D(Dn–1u)L2 and D(Dn u) L p.This work has been supported by MURST and GNAFA-CNR.  相似文献   

20.
Summary We study integral functionals of the formF(u, )= f(u)dx, defined foru C1(;R k), R n . The functionf is assumed to be polyconvex and to satisfy the inequalityf(A) c0¦(A)¦ for a suitable constant c0 > 0, where (A) is then-vector whose components are the determinants of all minors of thek×n matrixA. We prove thatF is lower semicontinuous onC 1(;R k) with respect to the strong topology ofL 1(;R k). Then we consider the relaxed functional , defined as the greatest lower semicontinuous functional onL 1(;R k ) which is less than or equal toF on C1(;R k). For everyu BV(;R k) we prove that (u,) f(u)dx+c0¦Dsu¦(), whereDu=u dx+Dsu is the Lebesgue decomposition of the Radon measureDu. Moreover, under suitable growth conditions onf, we show that (u,)= f(u)dx for everyu W1,p(;R k), withp min{n,k}. We prove also that the functional (u, ) can not be represented by an inte- gral for an arbitrary functionu BVloc(R n;R k). In fact, two examples show that, in general, the set function (u, ) is not subadditive whenu BVloc(R n;R k), even ifu W loc 1,p (R n;R k) for everyp < min{n,k}. Finally, we examine in detail the properties of the functionsu BV(;R k) such that (u, )= f(u)dx, particularly in the model casef(A)=¦(A)¦.  相似文献   

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

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