共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper investigates the solvability of discrete Dirichlet boundary value problems by the lower and upper solution method. Here, the second-order difference equation with a nonlinear right hand side f is studied and f(t,u,v) can have a superlinear growth both in u and in v. Moreover, the growth conditions on f are one-sided. We compute a priori bounds on solutions to the discrete problem and then obtain the existence of at least one solution. It is shown that solutions of the discrete problem will converge to solutions of ordinary differential equations. 相似文献
2.
A d-arc-dominated digraph is a digraph D of minimum out-degree d such that for every arc (x,y) of D, there exists a vertex u of D of out-degree d such that (u,x) and (u,y) are arcs of D. Henning and Yeo [Vertex disjoint cycles of different length in digraphs, SIAM J. Discrete Math. 26 (2012) 687–694] conjectured that a digraph with minimum out-degree at least four contains two vertex-disjoint cycles of different length. In this paper, we verify this conjecture for 4-arc-dominated digraphs. 相似文献
3.
Suppose X is a real q-uniformly smooth Banach space and F,K:X→X are Lipschitz ?-strongly accretive maps with D(K)=F(X)=X. Let u∗ denote the unique solution of the Hammerstein equation u+KFu=0. An iteration process recently introduced by Chidume and Zegeye is shown to converge strongly to u∗. No invertibility assumption is imposed on K and the operators K and F need not be defined on compact subsets of X. Furthermore, our new technique of proof is of independent interest. Finally, some interesting open questions are included. 相似文献
4.
A finite Sturmian word w is a balanced word over the binary alphabet {a,b}, that is, for all subwords u and v of w of equal length, ||u|a−|v|a|≤1, where |u|a and |v|a denote the number of occurrences of the letter a in u and v, respectively. There are several other characterizations, some leading to efficient algorithms for testing whether a finite word is Sturmian. These algorithms find important applications in areas such as pattern recognition, image processing, and computer graphics. Recently, Blanchet-Sadri and Lensmire considered finite semi-Sturmian words of minimal length and provided an algorithm for generating all of them using techniques from graph theory. In this paper, we exploit their approach in order to count the number of minimal semi-Sturmian words. We also present some other results that come from applying this graph theoretical framework to subword complexity. 相似文献
5.
Robert F. Bailey José Cáceres Delia Garijo Antonio González Alberto Márquez Karen Meagher María Luz Puertas 《European Journal of Combinatorics》2013
A set of vertices S in a graph G is a resolving set for G if, for any two vertices u,v, there exists x∈S such that the distances d(u,x)≠d(v,x). In this paper, we consider the Johnson graphs J(n,k) and Kneser graphs K(n,k), and obtain various constructions of resolving sets for these graphs. As well as general constructions, we show that various interesting combinatorial objects can be used to obtain resolving sets in these graphs, including (for Johnson graphs) projective planes and symmetric designs, as well as (for Kneser graphs) partial geometries, Hadamard matrices, Steiner systems and toroidal grids. 相似文献
6.
The paper deals with the radially symmetric solutions of ut=Δu+um(x,t)vn(0,t), vt=Δv+up(0,t)vq(x,t), subject to null Dirichlet boundary conditions. For the blow-up classical solutions, we propose the critical exponents for non-simultaneous blow-up by determining the complete and optimal classification for all the non-negative exponents: (i) There exist initial data such that u (v) blows up alone if and only if m>p+1 (q>n+1), which means that any blow-up is simultaneous if and only if m≤p+1, q≤n+1. (ii) Any blow-up is u (v) blowing up with v (u) remaining bounded if and only if m>p+1, q≤n+1 (m≤p+1, q>n+1). (iii) Both non-simultaneous and simultaneous blow-up may occur if and only if m>p+1, q>n+1. Moreover, we consider the blow-up rate and set estimates which were not obtained in the previously known work for the same model. 相似文献
7.
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 X in a bounded κ-fat open set; if u is a positive harmonic function with respect to X in a bounded κ-fat open set D and h is a positive harmonic function in D vanishing on Dc, then the non-tangential limit of u/h exists almost everywhere with respect to the Martin-representing measure of h. 相似文献
8.
Suppose X is a real q-uniformly smooth Banach space and F,K:X→X are bounded strongly accretive maps with D(K)=F(X)=X. Let u∗ denote the unique solution of the Hammerstein equation u+KFu=0. A new explicit coupled iteration process is shown to converge strongly to u∗. No invertibility assumption is imposed on K and the operators K and F need not be defined on compact subsets of X. Furthermore, our new technique of proof is of independent interest. Finally, some interesting open questions are included. 相似文献
9.
We study boundary value problems of the form -Δu=f on Ω and Bu=g on the boundary ∂Ω, with either Dirichlet or Neumann boundary conditions, where Ω is a smooth bounded domain in Rn and the data f,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 u in terms of f and g . For f=0, taking advantage of the fact that u 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≠0 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. 相似文献
10.
Mustapha Chellali Teresa W. Haynes Stephen T. Hedetniemi Alice McRae 《Discrete Applied Mathematics》2013
A subset S⊆V in a graph G=(V,E) is a [j,k]-set if, for every vertex v∈V?S, j≤|N(v)∩S|≤k for non-negative integers j and k, that is, every vertex v∈V?S is adjacent to at least j but not more than k vertices in S. In this paper, we focus on small j and k, and relate the concept of [j,k]-sets to a host of other concepts in domination theory, including perfect domination, efficient domination, nearly perfect sets, 2-packings, and k-dependent sets. We also determine bounds on the cardinality of minimum [1, 2]-sets, and investigate extremal graphs achieving these bounds. This study has implications for restrained domination as well. Using a result for [1, 3]-sets, we show that, for any grid graph G, the restrained domination number is equal to the domination number of G. 相似文献
11.
By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term h affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x), u>0 in Ω, u|∂Ω=∞, where Ω is a bounded domain with smooth boundary in RN, λ>0, g∈C1[0,∞) is increasing on [0,∞), g(0)=0, g′ is regularly varying at infinity with positive index ρ, the weight b, which is non-trivial and non-negative in Ω, may be vanishing on the boundary, and the inhomogeneous term h is non-negative in Ω and may be singular on the boundary. 相似文献
12.
The author deals with the quasilinear parabolic equation ut=[uα+g(u)]Δu+buα+1+f(u,∇u) with Dirichlet boundary conditions in a bounded domain Ω, where f and g are lower-order terms. He shows that, under suitable conditions on f and g, whether the solution is bounded or blows up in a finite time depends only on the first eigenvalue of −Δ in Ω with Dirichlet boundary condition. For some special cases, the result is sharp. 相似文献
13.
14.
Paul-Emile Maing 《Nonlinear Analysis: Theory, Methods & Applications》2008,68(12):3913-3922
This paper is concerned with the Cauchy problem for the fast diffusion equation ut−Δum=αup1 in RN (N≥1), where m∈(0,1), p1>1 and α>0. The initial condition u0 is assumed to be continuous, nonnegative and bounded. Using a technique of subsolutions, we set up sufficient conditions on the initial value u0 so that u(t,x) blows up in finite time, and we show how to get estimates on the profile of u(t,x) for small enough values of t>0. 相似文献
15.
We prove that if for a continuous map f on a compact metric space X, the chain recurrent set, R(f) has more than one chain component, then f does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f on a compact metric space X has the asymptotic average shadowing property and if A is an attractor for f, then A is the single attractor for f and we have A=R(f). We also study diffeomorphisms with asymptotic average shadowing property and prove that if M is a compact manifold which is not finite with dimM=2, then the C1 interior of the set of all C1 diffeomorphisms with the asymptotic average shadowing property is characterized by the set of Ω-stable diffeomorphisms. 相似文献
16.
Given a point A in the real Grassmannian, it is well-known that one can construct a soliton solution uA(x,y,t) to the KP equation. The contour plot of such a solution provides a tropical approximation to the solution when the variables x, y, and t are considered on a large scale and the time t is fixed. In this paper we use several decompositions of the Grassmannian in order to gain an understanding of the contour plots of the corresponding soliton solutions. First we use the positroid stratification of the real Grassmannian in order to characterize the unbounded line-solitons in the contour plots at y?0 and y?0. Next we use the Deodhar decomposition of the Grassmannian–a refinement of the positroid stratification–to study contour plots at t?0. More specifically, we index the components of the Deodhar decomposition of the Grassmannian by certain tableaux which we call Go-diagrams , and then use these Go-diagrams to characterize the contour plots of solitons solutions when t?0. Finally we use these results to show that a soliton solution uA(x,y,t) is regular for all times t if and only if A comes from the totally non-negative part of the Grassmannian. 相似文献
17.
In this note we study distance-regular graphs with a small number of vertices compared to the valency. We show that for a given α>2, there are finitely many distance-regular graphs Γ with valency k, diameter D≥3 and v vertices satisfying v≤αk unless (D=3 and Γ is imprimitive) or (D=4 and Γ is antipodal and bipartite). We also show, as a consequence of this result, that there are finitely many distance-regular graphs with valency k≥3, diameter D≥3 and c2≥εk for a given 0<ε<1 unless (D=3 and Γ is imprimitive) or (D=4 and Γ is antipodal and bipartite). 相似文献
18.
19.
In this paper we establish the boundedness of the extremal solution u∗ in dimension N=4 of the semilinear elliptic equation −Δu=λf(u), in a general smooth bounded domain Ω⊂RN, with Dirichlet data u|∂Ω=0, where f is a C1 positive, nondecreasing and convex function in [0,∞) such that f(s)/s→∞ as s→∞. 相似文献
20.
We study aspects of the analytic foundations of integration and closely related problems for functions of infinitely many variables x1,x2,…∈D. The setting is based on a reproducing kernel k for functions on D, a family of non-negative weights γu, where u varies over all finite subsets of N, and a probability measure ρ on D. We consider the weighted superposition K=∑uγuku of finite tensor products ku of k. Under mild assumptions we show that K is a reproducing kernel on a properly chosen domain in the sequence space DN, and that the reproducing kernel Hilbert space H(K) is the orthogonal sum of the spaces H(γuku). Integration on H(K) can be defined in two ways, via a canonical representer or with respect to the product measure ρN on DN. We relate both approaches and provide sufficient conditions for the two approaches to coincide. 相似文献