首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We establish C1,γ-partial regularity of minimizers of non-autono-mous convex integral functionals of the type: , with non-standard growth conditions into the gradient variable
  相似文献   

2.
We prove global well-posedness and scattering of -solutions of the loglog energy-supercritical Schrödinger equation , 0<c<cn, n={3,4}, with radial data , . This is achieved, roughly speaking, by extending Bourgain's argument in Bourgain (1999) [1] (see also Grillakis, 2000 [5]) and Tao's argument in Tao (2005) [10] in high dimensions.  相似文献   

3.
We consider the quasi-linear Keller-Segel system of singular type, where the principal part Δum represents a fast diffusion like 0<m<1. We first construct a global weak solution with small initial data in the scaling invariant norm for all dimensions N?2 and all exponents q?2. As for the large initial data, we show that there exists a blow-up solution in the case of N=2. In the second part, the decay property in Lr with 1<r<∞ for with the mass conservation is shown. On the other hand, in the case of , the extinction phenomenon of solution is proved. It is clarified that the case of exhibits the borderline in the sense that the decay and extinction occur when the diffusion power m changes across . For the borderline case of , our solution decays in Lr exponentially as t→∞.  相似文献   

4.
Let be the set of entrywise nonnegative n×n matrices. Denote by r(A) the spectral radius (Perron root) of . Characterization is obtained for maps such that r(f(A)+f(B))=r(A+B) for all . In particular, it is shown that such a map has the form
  相似文献   

5.
We consider the Yamabe equation in Rn, n?3. Let k?1 and . For all large k we find a solution of the form , where , for n?4, for n=3 and o(1)→0 uniformly as k→+∞.  相似文献   

6.
It is shown that if (X,‖⋅X) is a Banach space with Rademacher cotype q then for every integer n there exists an even integer such that for every we have
(1)  相似文献   

7.
For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then .  相似文献   

8.
In this paper we prove that in the general case (i.e. β not necessarily vanishing) the Cauchy problem for the Schrödinger-Korteweg-de Vries system is locally well-posed in , and if β=0 then it is locally well-posed in with . These results improve the corresponding results of Corcho and Linares (2007) [5]. Idea of the proof is to establish some bilinear and trilinear estimates in the space Gs×Fs, where Gs and Fs are dyadic Bourgain-type spaces related to the Schrödinger operator and the Airy operator , respectively, but with a modification on Fs in low frequency part of functions with a weaker structure related to the maximal function estimate of the Airy operator.  相似文献   

9.
Denote by , k=1,…,n, the zeros of the Laguerre-Sobolev-type polynomials orthogonal with respect to the inner product
  相似文献   

10.
11.
A real x is -Kurtz random (-Kurtz random) if it is in no closed null set ( set). We show that there is a cone of -Kurtz random hyperdegrees. We characterize lowness for -Kurtz randomness as being -dominated and -semi-traceable.  相似文献   

12.
Let be a triangulated category with a cluster tilting subcategory U. The quotient category is abelian; suppose that it has finite global dimension.We show that projection from to sends cluster tilting subcategories of to support tilting subcategories of , and that, in turn, support tilting subcategories of can be lifted uniquely to weak cluster tilting subcategories of .  相似文献   

13.
The domain of the Wiener integral with respect to a sub-fractional Brownian motion , , k≠0, is characterized. The set is a Hilbert space which contains the class of elementary functions as a dense subset. If , any element of is a function and if , the domain is a space of distributions.  相似文献   

14.
Let be a strictly stationary sequence of positively associated random variables with mean zero and finite variance. Set , Mn=maxk?n|Sk|, n?1. Suppose . In this paper, we study the exact convergence rates of a kind of weighted infinite series of , and as ε↘0, respectively.  相似文献   

15.
16.
In this paper, the authors prove that Besov-Morrey spaces are proper subspaces of Besov-type spaces and that Triebel-Lizorkin-Morrey spaces are special cases of Triebel-Lizorkin-type spaces . The authors also establish an equivalent characterization of when τ∈[0,1/p). These Besov-type spaces and Triebel-Lizorkin-type spaces were recently introduced to connect Besov spaces and Triebel-Lizorkin spaces with Q spaces. Moreover, for the spaces and , the authors investigate their trace properties and the boundedness of the pseudo-differential operators with homogeneous symbols in these spaces, which generalize the corresponding classical results of Jawerth and Grafakos-Torres by taking τ=0.  相似文献   

17.
For an abelian topological group G, let denote the dual group of all continuous characters endowed with the compact open topology. Given a closed subset X of an infinite compact abelian group G such that w(X)<w(G), and an open neighborhood U of 0 in T, we show that . (Here, w(G) denotes the weight of G.) A subgroup D of G determines G if the map defined by r(χ)=χ?D for , is an isomorphism between and . We prove that
  相似文献   

18.
Let H be a real Hilbert space. Let F:HH be a strongly monotone and Lipschitzian mapping. Let be an infinite family of non-expansive mappings with common fixed points set . We devise an iterative algorithm
  相似文献   

19.
Given two ordered trees and , the tree inclusion problem is to determine whether it is possible to obtain from by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for structured text databases. In this paper we present anO(|leaves()| ||) time andO(|leaves()|min(depth(), |leaves()|)) space algorithm for ordered tree inclusion, by means of a sophisticated bottom-up-matching strategy. Our algorithm improves the previous best one (Kilpeläinen, 1992, Ph.D. thesis, Dept. Computer Science, Univ. Helsinki) that requiresO(|| ||) time andO(||min(depth(), |leaves()|)) space.  相似文献   

20.
The Majority game is played by a questioner () and an answerer (). holds n elements, each of which can be labeled as 0 or 1. is trying to identify some element holds as having the Majority label or, in the case of a tie, claim there is none. To do this asks questions comparing whether two elements have the same or different label. ’s goal is to ask as few questions as possible while ’s goal is to delay as much as possible. Let q denote the minimal number of questions needed for to identify a Majority element regardless of ’s answers.In this paper we investigate upper and lower bounds for q in a variation of the Majority game, where is allowed to lie up to t times. We consider two versions of the game, the adaptive (where questions are asked sequentially) and the oblivious (where questions are asked in one batch).  相似文献   

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

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