首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
For a nonnegative, uniformly convex HC2(R2) with H(0)=0, if uC(Ω), ΩR2, is a viscosity solution of the Aronsson equation (1.7), then uC1(Ω). This generalizes the C1-regularity theorem on infinity harmonic functions in R2 by Savin [O. Savin, C1-regularity for infinity harmonic functions in dimensions two, Arch. Ration. Mech. Anal. 176 (3) (2005) 351–361] to the Aronsson equation.  相似文献   

3.
4.
The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of perfect matchings of G. Edmonds (J. Res. Nat. Bur. Standards Sect. B 69B 1965 125) showed that a vector x in QE belongs to the perfect matching polytope of G if and only if it satisfies the inequalities: (i) x0 (non-negativity), (ii) x(∂(v))=1, for all vV (degree constraints) and (iii) x(∂(S))1, for all odd subsets S of V (odd set constraints). In this paper, we characterize graphs whose perfect matching polytopes are determined by non-negativity and the degree constraints. We also present a proof of a recent theorem of Reed and Wakabayashi.  相似文献   

5.
In this paper we shall consider the relationships between a local version of the single valued extension property of a bounded operator T  L(X) on a Banach space X and some quantities associated with T which play an important role in Fredholm theory. In particular, we shall consider some conditions for which T does not have the single valued extension property at a point λo  C.  相似文献   

6.
Let K be a convex body in d (d2), and denote by Bn(K) the set of all polynomials pn in d of total degree n such that |pn|1 on K. In this paper we consider the following question: does there exist a p*nBn(K) which majorates every element of Bn(K) outside of K? In other words can we find a minimal γ1 and p*nBn(K) so that |pn(x)|γ |p*n(x)| for every pnBn(K) and x d\K? We discuss the magnitude of γ and construct the universal majorants p*n for evenn. It is shown that γ can be 1 only on ellipsoids. Moreover, γ=O(1) on polytopes and has at most polynomial growth with respect to n, in general, for every convex body K.  相似文献   

7.
A Gabor system is a set of time-frequency shifts S(g, Λ) ={e2 π ibxg(xa)}(a, b) Λ of a function g L2(Rd). We prove that if a finite union of Gabor systems k = 1rS(gk, Λk) forms a frame for L2(Rd) then the lower and upper Beurling densities of Λ = k = 1r Λk satisfy D(Λ) ≥ 1 and D + (Λ) < ∞. This extends recent work of Ramanathan and Steger. Additionally, we prove the conjecture that no collection k = 1r{gk(xa)}a Γk of pure translates can form a frame for L2(Rd).  相似文献   

8.
Let X={X(t), t[0,1]} be a process on [0,1] and VX=Conv{(t,x)t[0,1], x=X(t)} be the convex hull of its path.The structure of the set ext(VX) of extreme points of VX is studied. For a Gaussian process X with stationary increments it is proved that:
• The set ext(VX) is negligible if X is non-differentiable.
• If X is absolutely continuous process and its derivative X′ is continuous but non-differentiable, then ext(VX) is also negligible and moreover it is a Cantor set.
It is proved also that these properties are stable under the transformations of the type Y(t)=f(X(t)), if f is a sufficiently smooth function.  相似文献   

9.
10.
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of class two graphs that can be embedded in a surface. For each surface Σ, we define Δ(Σ)=max{Δ(G)| G is a class two graph of maximum degree Δ that can be embedded in Σ}. Hence Vizing's Planar Graph Conjecture can be restated as Δ(Σ)=5 if Σ is a plane. We show that Δ(Σ)=7 if (Σ)=−1 and Δ(Σ)=8 if (Σ){−2,−3}.  相似文献   

11.
Let G be a graph. For u,vV(G) with distG(u,v)=2, denote JG(u,v)={wNG(u)∩NG(v)|NG(w)NG(u)NG(v){u,v}}. A graph G is called quasi claw-free if JG(u,v)≠ for any u,vV(G) with distG(u,v)=2. In 1986, Thomassen conjectured that every 4-connected line graph is hamiltonian. In this paper we show that every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.  相似文献   

12.
We apply the techniques of monotone and relative rearrangements to the nonrearrangement invariant spaces Lp()(Ω) with variable exponent. In particular, we show that the maps uLp()(Ω)→k(t)u*Lp*()(0,measΩ) and uLp()(Ω)→u*Lp*()(0,measΩ) are locally -Hölderian (u* (resp. p*) is the decreasing (resp. increasing) rearrangement of u (resp. p)). The pointwise relations for the relative rearrangement are applied to derive the Sobolev embedding with eventually discontinuous exponents.  相似文献   

13.
It is known that shape preserving approximation has lower rates than unconstrained approximation. This is especially true for copositive and intertwining approximations. ForfLp, 1p<∞, the former only has rateω(fn−1)p, and the latter cannot even be bounded byC fp. In this paper, we discuss various ways to relax the restrictions in these approximations and conclude that the most sensible way is the so-calledalmostcopositive/intertwining approximation in which one relaxes the restriction on the approximants in a neighborhood of radiusΔn(yj) of each sign changeyj.  相似文献   

14.
Splitting off a pair susv of edges in a graph G means the operation that deletes su and sv and adds a new edge uv. Given a graph G = (V + sE) which is k-edge-connected (k ≥ 2) between vertices of V and a specified subset R  V, first we consider the problem of finding a longest possible sequence of disjoint pairs of edges sxsy, (x ,y  R) which can be split off preserving k-edge-connectivity in V. If R = V and d(s) is even then a well-known theorem of Lovász asserts that a complete R-splitting exists, that is, all the edges connecting s to R can be split off in pairs. This is not the case in general. We characterize the graphs possessing a complete R-splitting and give a formula for the length of a longest R-splitting sequence. Motivated by the connection between splitting off results and connectivity augmentation problems we also investigate the following problem that we call the split completion problem: given G and R as above, find a smallest set F of new edges incident to s such that G′ = (V + sE + F) has a complete R-splitting. We give a min-max formula for F as well as a polynomial algorithm to find a smallest F. As a corollary we show a polynomial algorithm which finds a solution of size at most k/2 + 1 more than the optimum for the following augmentation problem, raised in [[2]]: given a graph H = (VE), an integer k ≥ 2, and a set R  V, find a smallest set F′ of new edges for which H′ = (VE + F′) is k-edge-connected and no edge of F′ crosses R.  相似文献   

15.
LetSβ{z : |Im z|<β}. For 2π-periodic functions which are analytic inSβwithp-integrable boundary values, we construct an optimal method of recovery off′(ξ), ξSβ, using information about the valuesf(x1), mldr;, f(xn), xj[0, 2π).  相似文献   

16.
The generalized nonlinear Schrödinger equation (GNLS) iut + uxx + βu2u + γu4u +  (u2u)x + (u2)xu = 0 is studied. Using the bifurcation of travelling waves of this equation, some exact solitary wave solutions were obtained in [Wang W, Sun J,Chen G, Bifurcation, Exact solutions and nonsmooth behavior of solitary waves in the generalized nonlinear Schrödinger equation. Int J Bifucat Chaos 2005:3295–305.]. In this paper, more explicit exact solitary wave solutions and some new smooth periodic wave solutions are obtained.  相似文献   

17.
Let k be a field with an involution σ and a non-degenerate sesquilinear form, where V,W are n-dimensional k-spaces. Assume that ΛEnd(V) and Λ*End(W) are dual operators. We show that if Λ and Λ* are similar, then Λ*=Λ-1, where :VW is Hermitian.  相似文献   

18.
In [A. Biró, V.T. Sós, Strong characterizing sequences in simultaneous Diophantine approximation, J. Number Theory 99 (2003) 405–414] we proved that if Γ is a subgroup of the torus R/Z generated by finitely many independent irrationals, then there is an infinite subset AZ which characterizes Γ in the sense that for γR/Z we have ∑aAaγ<∞ if and only if γΓ. Here we consider a general compact metrizable Abelian group G instead of R/Z, and we characterize its finitely generated free subgroups Γ by subsets AG*, where G* is the Pontriagin dual of G. For this case we prove stronger forms of the analogue of the theorem of the above mentioned work, and we find necessary and sufficient conditions for a kind of strengthening of this statement to be true.  相似文献   

19.
Letμbe a Gaussian measure (say, onRn) and letK,LRnbe such thatKis convex,Lis a “layer” (i.e.,L={xaxub} for someabRanduRn), and the centers of mass (with respect toμ) ofKandLcoincide. Thenμ(KL)μ(Kμ(L). This is motivated by the well-known “positive correlation conjecture” for symmetric sets and a related inequality of Sidak concerning confidence regions for means of multivariate normal distributions. The proof uses the estimateΦ(x)> 1−((8/π)1/2/(3x+(x2+8)1/2))ex2/2,x>−1, for the (standard) Gaussian cumulative distribution function, which is sharper than the classical inequality of Komatsu.  相似文献   

20.
Let E be a real reflexive Banach space with uniformly Gâteaux differentiable norm. Let K be a nonempty bounded closed and convex subset of E. Let T:KK be a strictly pseudo-contractive map and let L>0 denote its Lipschitz constant. Assume F(T){xK:Tx=x}≠0/ and let zF(T). Fix δ(0,1) and let δ* be such that δ*δL(0,1). Define , where δn(0,1) and limδn=0. Let {αn} be a real sequence in (0,1) which satisfies the following conditions: . For arbitrary x0,uK, define a sequence {xn}K by xn+1=αnu+(1−αn)Snxn. Then, {xn} converges strongly to a fixed point of T.  相似文献   

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

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