共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
Assume that the problem P0 is not solvable in polynomial time. Let T be a first-order theory containing a sufficiently rich part of true arithmetic. We characterize T∪{ConT} as the minimal extension of T proving for some algorithm that it decides P0 as fast as any algorithm B with the property that T proves that B decides P0. Here, ConT claims the consistency of T. As a byproduct, we obtain a version of Gödel?s Second Incompleteness Theorem. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories. 相似文献
3.
Consider in a real Hilbert space H the Cauchy problem (P0): u′(t)+Au(t)+Bu(t)=f(t), 0≤t≤T; u(0)=u0, where −A is the infinitesimal generator of a C0-semigroup of contractions, B is a nonlinear monotone operator, and f is a given H-valued function. Inspired by the excellent book on singular perturbations by J.L. Lions, we associate with problem (P0) the following regularization (Pε): −εu″(t)+u′(t)+Au(t)+Bu(t)=f(t), 0≤t≤T; u(0)=u0, u′(T)=uT, where ε>0 is a small parameter. We investigate existence, uniqueness and higher regularity for problem (Pε). Then we establish asymptotic expansions of order zero, and of order one, for the solution of (Pε). Problem (Pε) turns out to be regularly perturbed of order zero, and singularly perturbed of order one, with respect to the norm of C([0,T];H). However, the boundary layer of order one is not visible through the norm of L2(0,T;H). 相似文献
4.
In this paper, we consider the problem (Pε) : Δ2u=un+4/n-4+εu,u>0 in Ω,u=Δu=0 on ∂Ω, where Ω is a bounded and smooth domain in Rn,n>8 and ε>0. We analyze the asymptotic behavior of solutions of (Pε) which are minimizing for the Sobolev inequality as ε→0 and we prove existence of solutions to (Pε) which blow up and concentrate around a critical point of the Robin's function. Finally, we show that for ε small, (Pε) has at least as many solutions as the Ljusternik–Schnirelman category of Ω. 相似文献
5.
6.
Let I=[0,1] and let P be a partition of I into a finite number of intervals. Let τ1, τ2; I→I be two piecewise expanding maps on P . Let G⊂I×I be the region between the boundaries of the graphs of τ1 and τ2. Any map τ:I→I that takes values in G is called a selection of the multivalued map defined by G . There are many results devoted to the study of the existence of selections with specified topological properties. However, there are no results concerning the existence of selection with measure-theoretic properties. In this paper we prove the existence of selections which have absolutely continuous invariant measures (acim). By our assumptions we know that τ1 and τ2 possess acims preserving the distribution functions F(1) and F(2). The main result shows that for any convex combination F of F(1) and F(2) we can find a map η with values between the graphs of τ1 and τ2 (that is, a selection) such that F is the η-invariant distribution function. Examples are presented. We also study the relationship of the dynamics of our multivalued maps to random maps. 相似文献
7.
Let K be a closed convex subset of a q-uniformly smooth separable Banach space, T:K→K a strictly pseudocontractive mapping, and f:K→K an L-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1), let xt be the unique fixed point of tf+(1-t)T. We prove that if T has a fixed point, then {xt} converges to a fixed point of T as t approaches to 0. 相似文献
8.
9.
10.
We study the problem (−Δ)su=λeu in a bounded domain Ω⊂Rn, where λ is a positive parameter. More precisely, we study the regularity of the extremal solution to this problem. Our main result yields the boundedness of the extremal solution in dimensions n≤7 for all s∈(0,1) whenever Ω is, for every i=1,...,n, convex in the xi-direction and symmetric with respect to {xi=0}. The same holds if n=8 and s?0.28206..., or if n=9 and s?0.63237.... These results are new even in the unit ball Ω=B1. 相似文献
11.
We show that for each p∈(0,1] there exists a separable p -Banach space Gp of almost universal disposition, that is, having the following extension property: for each ε>0 and each isometric embedding g:X→Y, where Y is a finite-dimensional p-Banach space and X is a subspace of Gp, there is an ε -isometry f:Y→Gp such that x=f(g(x)) for all x∈X. 相似文献
12.
Mahmood Alaghmandan Yemon Choi Ebrahim Samei 《Journal of Mathematical Analysis and Applications》2014
Let G be a restricted direct product of finite groups {Gi}i∈I, and let Z?1(G) denote the centre of its group algebra. We show that Z?1(G) is amenable if and only if Gi is abelian for all but finitely many i , and characterize the maximal ideals of Z?1(G) which have bounded approximate identities. We also study when an algebra character of Z?1(G) belongs to c0 or ?p and provide a variety of examples. 相似文献
13.
Given n independent standard normal random variables, it is well known that their maxima Mn can be normalized such that their distribution converges to the Gumbel law. In a remarkable study, Hall proved that the Kolmogorov distance dn between the normalized Mn and its associated limit distribution is less than 3/log?n. In the present study, we propose a different set of norming constants that allow this upper bound to be decreased with dn≤C(m)/log?n for n≥m≥5. Furthermore, the function C(m) is computed explicitly, which satisfies C(m)≤1 and limm→∞?C(m)=1/3. As a consequence, some new and effective norming constants are provided using the asymptotic expansion of a Lambert W type function. 相似文献
14.
Jean-Pierre Kahane 《Comptes Rendus Mathematique》2014,352(5):383-385
For almost all x>1, (xn)(n=1,2,…) is equidistributed modulo 1, a classical result. What can be said on the exceptional set? It has Hausdorff dimension one. Much more: given an (bn) in [0,1[ and ε>0, the x -set such that |xn−bn|<ε modulo 1 for n large enough has dimension 1. However, its intersection with an interval [1,X] has a dimension <1, depending on ε and X. Some results are given and a question is proposed. 相似文献
15.
In this paper we investigate the one-dimensional Schrodinger operator L(q) with complex-valued periodic potential q when q∈L1[0,1] and qn=0 for n=0,−1,−2,..., where qn are the Fourier coefficients of q with respect to the system {ei2πnx}. We prove that the Bloch eigenvalues are (2πn+t)2 for n∈Z, t∈C and find explicit formulas for the Bloch functions. Then we consider the inverse problem for this operator. 相似文献
16.
17.
18.
In this paper, the pattern of the soliton solutions to the discrete nonlinear Schrödinger (DNLS) equations in a 2D lattice is studied by the construction of horseshoes in l∞-spaces. The spatial disorder of the DNLS equations is the result of the strong amplitudes and stiffness of the nonlinearities. The complexity of this disorder is log(N+1) where N is the number of turning points of the nonlinearities. For the case N=1, there exist disjoint intervals I0 and I1, for which the state um,n at site (m,n) can be either dark (um,n∈I0) or bright (um,n∈I1) that depends on the configuration km,n=0 or 1, respectively. Bright soliton solutions of the DNLS equations with a cubic nonlinearity are also discussed. 相似文献
19.
M. Gürdal 《Expositiones Mathematicae》2009,27(2):153-160
In the present paper we consider the Volterra integration operator V on the Wiener algebra W(D) of analytic functions on the unit disc D of the complex plane C. A complex number λ is called an extended eigenvalue of V if there exists a nonzero operator A satisfying the equation AV=λVA. We prove that the set of all extended eigenvalues of V is precisely the set C?{0}, and describe in terms of Duhamel operators and composition operators the set of corresponding extended eigenvectors of V. The similar result for some weighted shift operator on ?p spaces is also obtained. 相似文献
20.
Given k pairs of vertices (si,ti)(1≤i≤k) of a digraph G, how can we test whether there exist k vertex-disjoint directed paths from si to ti for 1≤i≤k? This is NP-complete in general digraphs, even for k=2 [2], but for k=2 there is a polynomial-time algorithm when G is a tournament (or more generally, a semicomplete digraph), due to Bang-Jensen and Thomassen [1]. Here we prove that for all fixed k there is a polynomial-time algorithm to solve the problem when G is semicomplete. 相似文献