首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
In this paper we consider a nonlinear eigenvalue problem driven by the pp-Laplacian differential operator and with a nonsmooth potential. Using degree theoretic arguments based on the degree map for certain operators of monotone type, we show that the problem has at least two nontrivial positive solutions as the parameter λ>0λ>0 varies in a half-line.  相似文献   

2.
It is shown that if a sequence of open nn-sets DkDk increases to an open nn-set DD then reflected stable processes in DkDk converge weakly to the reflected stable process in DD for every starting point xx in DD. The same result holds for censored αα-stable processes for every xx in DD if DD and DkDk satisfy the uniform Hardy inequality. Using the method in the proof of the above results, we also prove the weak convergence of reflected Brownian motions in unbounded domains.  相似文献   

3.
In this paper, we establish an oscillation estimate of nonnegative harmonic functions for a pure-jump subordinate Brownian motion. The infinitesimal generator of such subordinate Brownian motion is an integro-differential operator. As an application, we give a probabilistic proof of the following form of relative Fatou theorem for such subordinate Brownian motion XX in a bounded κκ-fat open set; if uu is a positive harmonic function with respect to XX in a bounded κκ-fat open set DD and hh is a positive harmonic function in DD vanishing on DcDc, then the non-tangential limit of u/hu/h exists almost everywhere with respect to the Martin-representing measure of hh.  相似文献   

4.
A semicomplete multipartite or semicomplete cc-partite digraph DD is a biorientation of a cc-partite graph. A semicomplete multipartite digraph DD is called strongly quasi-Hamiltonian-connected, if for any two distinct vertices xx and yy of DD, there is a path PP from xx to yy such that PP contains at least one vertex from each partite set of DD.  相似文献   

5.
6.
We show how subintegral extensions of certain local Noetherian domains SS can be constructed with specified invariants including reduction number, Hilbert function, multiplicity and local cohomology. The construction behaves analytically like Nagata idealization but rather than a ring extension of SS, it produces a subring RR of SS such that R⊆SRS is subintegral.  相似文献   

7.
8.
Let GG be a group. Any GG-module MM has an algebraic structure called a GG-family of Alexander quandles. Given a 2-cocycle of a cohomology associated with this GG-family, topological invariants of (handlebody) knots in the 3-sphere are defined. We develop a simple algorithm to algebraically construct nn-cocycles of this GG-family from GG-invariant group nn-cocycles of the abelian group MM. We present many examples of 2-cocycles of these GG-families using facts from (modular) invariant theory.  相似文献   

9.
We consider the Dirichlet problem for the p  -Laplacian evolution equation, ut=Δpuut=Δpu, where p>2p>2, posed in an exterior domain in RNRN, with zero Dirichlet boundary condition and with integrable and nonnegative initial data. We are interested in describing the influence of the holes of the domain on the large time behaviour of the solutions. Such behaviour varies depending on the relative values of N and p  . We must distinguish between the behaviour near infinity of space (outer analysis), and near the holes (inner analysis). We obtain that the outer analysis is given in all cases by certain self-similar solutions and the inner analysis is given by quasi-stationary states. Logarithmic corrections to exact self-similarity appear in the critical case N=pN=p, which is mathematically more interesting. In this first paper we treat only the cases N>pN>p and N=pN=p, the case N<pN<p will be considered in a companion work.  相似文献   

10.
11.
A tournament of order nn is usually considered as an orientation of the complete graph KnKn. In this note, we consider a more general definition of a tournament that we call aCC-tournament, where CC is the adjacency matrix of a multigraph GG, and a CC-tournament is an orientation of GG. The score vector of a CC-tournament is the vector of outdegrees of its vertices. In 1965 Hakimi obtained necessary and sufficient conditions for the existence of a CC-tournament with a prescribed score vector RR and gave an algorithm to construct such a CC-tournament which required, however, some backtracking. We give a simpler and more transparent proof of Hakimi’s theorem, and then provide a direct construction of such a CC-tournament which works even for weighted graphs.  相似文献   

12.
We show that, for any compact Alexandrov surface SS (without boundary) and any point yy in SS, there exists a point xx in SS for which yy is a critical point. Moreover, we prove that uniqueness characterizes the surfaces homeomorphic to the sphere among smooth orientable surfaces.  相似文献   

13.
We study boundary value problems of the form -Δu=f-Δu=f on ΩΩ and Bu=gBu=g on the boundary ∂ΩΩ, with either Dirichlet or Neumann boundary conditions, where ΩΩ is a smooth bounded domain in RnRn and the data f,gf,g are distributions  . This problem has to be first properly reformulated and, for practical applications, it is of crucial importance to obtain the continuity of the solution uu in terms of f and g  . For f=0f=0, taking advantage of the fact that uu is harmonic on ΩΩ, we provide four formulations of this boundary value problem (one using nontangential limits of harmonic functions, one using Green functions, one using the Dirichlet-to-Neumann map, and a variational one); we show that these four formulations are equivalent. We provide a similar analysis for f≠0f0 and discuss the roles of f and g, which turn to be somewhat interchangeable in the low regularity case. The weak formulation is more convenient for numerical approximation, whereas the nontangential limits definition is closer to the intuition and easier to check in concrete situations. We extend the weak formulation to polygonal domains using weighted Sobolev spaces. We also point out some new phenomena for the “concentrated loads” at the vertices in the polygonal case.  相似文献   

14.
We extend some known results on radicals and prime ideals from polynomial rings and Laurent polynomial rings to ZZ-graded rings, i.e, rings graded by the additive group of integers. The main of them concerns the Brown–McCoy radical GG and the radical SS, which for a given ring AA is defined as the intersection of prime ideals II of AA such that A/IA/I is a ring with a large center. The studies are related to some open problems on the radicals GG and SS of polynomial rings and situated in the context of Koethe’s problem.  相似文献   

15.
The sensitivity set of a Boolean function at a particular input is the set of input positions where changing that one bit changes the output. Analogously we define the sensitivity set of a Boolean formula in a conjunctive normal form at a particular truth assignment, it is the set of positions where changing that one bit of the truth assignment changes the evaluation of at least one of the conjunct in the formula. We consider Boolean formulas in a generalized conjunctive normal form. Given a set ?? of Boolean functions, an ??-constraint is an application of a function from ?? to a tuple of literals built upon distinct variables, an ??-formula is then a conjunction of ??-constraints. In this framework, given a truth assignment II and a set of positions SS, we are able to enumerate all ??-formulas that are satisfied by II and that have SS as the sensitivity set at II. We prove that this number depends on the cardinality of SS only, and can be expressed according to the sensitivity of the Boolean functions in ??.  相似文献   

16.
17.
Let G=(V,E)G=(V,E) be a graph. A subset D⊆VDV is a dominating set if every vertex not in DD is adjacent to a vertex in DD. A dominating set DD is called a total dominating set if every vertex in DD is adjacent to a vertex in DD. The domination (resp. total domination) number of GG is the smallest cardinality of a dominating (resp. total dominating) set of GG. The bondage (resp. total bondage) number of a nonempty graph GG is the smallest number of edges whose removal from GG results in a graph with larger domination (resp. total domination) number of GG. The reinforcement (resp. total reinforcement) number of GG is the smallest number of edges whose addition to GG results in a graph with smaller domination (resp. total domination) number. This paper shows that the decision problems for the bondage, total bondage, reinforcement and total reinforcement numbers are all NP-hard.  相似文献   

18.
Let RR be a commutative ring with identity. We will say that an RR-module MM satisfies the weak Nakayama property, if IM=MIM=M, where II is an ideal of RR, implies that for any x∈MxM there exists a∈IaI such that (a−1)x=0(a1)x=0. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if RR is a local ring, then RR is a Max ring if and only if J(R)J(R), the Jacobson radical of RR, is TT-nilpotent if and only if every RR-module satisfies the weak Nakayama property.  相似文献   

19.
We prove the existence of multiple constant-sign and sign-changing solutions for a nonlinear elliptic eigenvalue problem under Dirichlet boundary condition involving the pp-Laplacian. More precisely, we establish the existence of a positive solution, of a negative solution, and of a nontrivial sign-changing solution when the eigenvalue parameter λλ is greater than the second eigenvalue λ2λ2 of the negative pp-Laplacian, extending results by Ambrosetti–Lupo, Ambrosetti–Mancini, and Struwe. Our approach relies on a combined use of variational and topological tools (such as, e.g., critical points, Mountain-Pass theorem, second deformation lemma, variational characterization of the first and second eigenvalue of the pp-Laplacian) and comparison arguments for nonlinear differential inequalities. In particular, the existence of extremal nontrivial constant-sign solutions plays an important role in the proof of sign-changing solutions.  相似文献   

20.
By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term hh affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x)u=b(x)g(u)+λh(x), u>0u>0 in ΩΩ, u|Ω=∞u|Ω=, where ΩΩ is a bounded domain with smooth boundary in RNRN, λ>0λ>0, g∈C1[0,∞)gC1[0,) is increasing on [0,∞)[0,), g(0)=0g(0)=0, gg is regularly varying at infinity with positive index ρρ, the weight bb, which is non-trivial and non-negative in ΩΩ, may be vanishing on the boundary, and the inhomogeneous term hh is non-negative in ΩΩ and may be singular on the boundary.  相似文献   

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

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