首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
The primary purpose of this paper is to investigate a family of elliptic systems of linear elasticity with rapidly oscillating periodic coefficients, arising in the theory of homogenization in Lipschitz domains. As a consequence, for d4, we prove that the Lp Neumann and Lp Dirichlet boundary value problems for systems of second order linear elasticity are uniquely solvable for 2(d?1)d+1?δ<p<2+δ and 2?δ<p<2(d?1)d?3+δ respectively.  相似文献   

5.
6.
7.
8.
Consider the Hénon equation with the homogeneous Neumann boundary condition
?Δu+u=|x|αup,u>0inΩ,?u?ν=0 on ?Ω,
where Ω?B(0,1)?RN,N2 and ?Ω?B(0,1)?. We are concerned on the asymptotic behavior of ground state solutions as the parameter α. As α, the non-autonomous term |x|α is getting singular near |x|=1. The singular behavior of |x|α for large α>0 forces the solution to blow up. Depending subtly on the (N?1)?dimensional measure |?Ω?B(0,1)|N?1 and the nonlinear growth rate p, there are many different types of limiting profiles. To catch the asymptotic profiles, we take different types of renormalization depending on p and |?Ω?B(0,1)|N?1. In particular, the critical exponent 2?=2(N?1)N?2 for the Sobolev trace embedding plays a crucial role in the renormalization process. This is quite contrasted with the case of Dirichlet problems, where there is only one type of limiting profile for any p(1,2??1) and a smooth domain Ω.  相似文献   

9.
Recently R. Danchin showed the existence and uniqueness for an inhomogenous fluid in the homogeneous Besov space B˙21N2(RN)×B˙21?1+N2(RN), under the condition that ρ0?1 is small in B˙2N2L if 2<N, in B˙21N2 if N=2. In this Note, one shows that the condition 6ρ0?16L?1 is sufficient to have the existence and uniqueness. To cite this article: H. Abidi, C. R. Acad. Sci. Paris, Ser. I 342 (2006).  相似文献   

10.
11.
Let m be an integer ?3, set ?(r)=12(r12+?+rm?12)+rm for rRm, and consider a badly approximable vector ω¯0Rm?2. Fix α>1, L>0 and R>1+6ω¯06. We construct a sequence (HN) of Gevrey-(α,L) Hamiltonian functions of Tm×B¯(0,R), which converges to ? when N, such that for each N the system generated by HN possesses a (m?1)-dimensional hyperbolic invariant torus with fixed frequency vector (ω¯0,1), which admits a homoclinic point with splitting matrix of the form diag(0,νN,,νN,0)Mm(R), with νN?exp(?c(1?N)12(α?1)(m?2)), where ?N:=6HN??6α,L and c>0. To cite this article: J.-P. Marco, C. R. Acad. Sci. Paris, Ser. I 340 (2005).  相似文献   

12.
We study positive solutions of the equation ?2Δu?u+un+2n?2=0, where n=3,4,5 and ?>0 is small, with Neumann boundary condition in a unit ball B. We prove the existence of solutions with an interior bubble at the center and a boundary layer at the boundary ?B. To cite this article: J. Wei, S. Yan, C. R. Acad. Sci. Paris, Ser. I 343 (2006).  相似文献   

13.
A hyperplane of the symplectic dual polar space DW(2n?1,F), n2, is said to be of subspace-type if it consists of all maximal singular subspaces of W(2n?1,F) meeting a given (n?1)-dimensional subspace of PG(2n?1,F). We show that a hyperplane of DW(2n?1,F) is of subspace-type if and only if every hex F of DW(2n?1,F) intersects it in either F, a singular hyperplane of F or the extension of a full subgrid of a quad. In the case F is a perfect field of characteristic 2, a stronger result can be proved, namely a hyperplane H of DW(2n?1,F) is of subspace-type or arises from the spin-embedding of DW(2n?1,F)?DQ(2n,F) if and only if every hex F intersects it in either F, a singular hyperplane of F, a hexagonal hyperplane of F or the extension of a full subgrid of a quad.  相似文献   

14.
15.
A connected graph G with at least 2m+2n+2 vertices is said to satisfy the property E(m,n) if G contains a perfect matching and for any two sets of independent edges M and N with |M|=m and |N|=n with MN=?, there is a perfect matching F in G such that M?F and NF=?. In particular, if G is E(m,0), we say that G is m-extendable. One of the authors has proved that every m-tough graph of even order at least 2m+2 is m-extendable (Plummer, 1988). Chen (1995) and Robertshaw and Woodall (2002) gave sufficient conditions on binding number for m-extendability. In this paper, we extend these results and give lower bounds on toughness and binding number which guarantee E(m,n).  相似文献   

16.
17.
The k-power graph of a graph G is a graph with the same vertex set as G, in that two vertices are adjacent if and only if, there is a path between them in G of length at most k. A k-tree-power graph is the k-power graph of a tree, a k-leaf-power graph is the subgraph of some k-tree-power graph induced by the leaves of the tree.We show that (1) every k-tree-power graph has NLC-width at most k+2 and clique-width at most k+2+max{?k2??1,0}, (2) every k-leaf-power graph has NLC-width at most k and clique-width at most k+max{?k2??2,0}, and (3) every k-power graph of a graph of tree-width l has NLC-width at most (k+1)l+1?1, and clique-width at most 2?(k+1)l+1?2.  相似文献   

18.
19.
In this Note, we give sufficient conditions for the regularity of Leray–Hopf weak solutions to the Navier–Stokes equation. We prove that, if one of three conditions (i) ?u/?x3Lts0Lxr0 where 2/s0+3/r0?2 and 9/4?r0?3, (ii) ?u3Lts1Lxr1 where 2/s1+3/r1?11/6 and 54/23?r0?18/5, or (iii) u3Lts0Lxr0 where 2/s0+3/r0?5/8 and 24/5?r0?, is satisfied, then the solution is regular. These conditions improve earlier results on the conditional regularity of the Navier–Stokes equations. To cite this article: I. Kukavica, M. Ziane, C. R. Acad. Sci. Paris, Ser. I 343 (2006).  相似文献   

20.
It is known that i=11(i(i+1))=1. In 1968, Meir and Moser (1968) asked for finding the smallest ? such that all the rectangles of sizes 1i×1(i+1), i{1,2,}, can be packed into a square or a rectangle of area 1+?. First we show that in Paulhus (1997), the key lemma, as a statement, in the proof of the smallest published upper bound of the minimum area is false, then we prove a different new upper bound. We show that ?1.26?10?9 if the rectangles are packed into a square and ?6.878?10?10 if the rectangles are packed into a rectangle.  相似文献   

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

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