首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We show that the operator Hs has a complete set of eigenfunctions and eigenvalues , which satisfy [2l(l + 1) - (3n2 + 3n + 1)]s + o(s) and lims→0 = 0. The functions are given in spherical coordinates as a product of generalized Laguerre functions and spherical harmonics.  相似文献   

2.
Let Ωi ? ?N, i = 0, 1, be two bounded separately star-shaped domains such that $ \Omega _0 \supset \bar \Omega _1 $. We consider the electrostatic potential u defined in $ \Omega : = \Omega _0 \backslash \bar \Omega _1 $: The geometry of the two boundary components Γ0 and Γ1 is not given, but instead the electrostatic potential u is supposed to satisfy the further boundary conditions Using a best possible maximum principle, we show that this free boundary problem has a unique solution which is radially symmetric.  相似文献   

3.
In this paper we obtain necessary and sufficient conditions for the validity of the estimate The constant c does not depend on u. u is a vector field with values in ?3. It is defined on a bounded set G of ?3 or an unbounded one, denoted by ?. The boundary conditions are as follows: either the normal component of u vanishes or the tangential one does. Our conditions are expressed in terms of the Betti numbers of G or ?.  相似文献   

4.
Sufficient conditions are obtained for the linear stability of the positive equilibrium of the neutral system in terms of the parameters of the system. The case n=2 is considered in detail and the general case is discussed briefly.  相似文献   

5.
Let G be a graph with a known triangular embedding in a surface S, and consider G(m), the composition of G with an independant set of order m. The purpose of this paper is to construct a triangular embedding of G(m) into a surface by using a covering triangulation with folds. We make the construction for three cases. One of them is used for proving that G(m) can be triangularly embedded into a surface if G is an Eulerian graph which can be triangularly embedded into a surface S with the same orientability characteristic as .  相似文献   

6.
In this note, we show how the determinant of the distance matrix D(G) of a weighted, directed graph G can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks Gi of G. In particular, when cof D(G), the sum of the cofactors of D(G), does not vanish, we have the very attractive formula .  相似文献   

7.
8.
We consider P(G is connected) when G is a graph with vertex set Z+ = {1,2, …}, and the edge between i and j is present with probability p(i, j) = min(λ h(i, j), 1) for certain functions h(i, j) homogeneous of degree -1. It is known that there is a critical value λc of λ such that . We show that the probability, at the critical point λc, that n1, and n2 are connected satisfies a power law, in the sense that for n2nt ≧ 1 for any δ > 0 and certain constants c1 and c2.  相似文献   

9.
Let Φ(t) and Ψ(t) be the functions having the following representations Φ(t) = ∫a(s)ds and Ψ(t) = ∫b(s) ds, where a(s) is a positive continuous function such that ∫a(s)/s ds = + ∞ and b(s) is an increasing function such that lims→ ∞ b(s) = + ∞. Then the following statements for the Hardy - Littlewood maximal function M f (x) are equivalent:
  • 1 (i) there exist positive constants c1 and s0 such that
  • 1 (ii) there exist positive constant c2 and c3 such that
.  相似文献   

10.
New upper bounds for the ramsey numbers r(k, l) are obtained. In particular it is shown there is a constant A such that   相似文献   

11.
The authors study symmetric operator matrices in the product of Hilbert spaces H = H1×H2, where the entries are not necessarily bounded operators. Under suitable assumptions the closure Lo exists and is a selfadjoint operator in H. With Lo, the closure of the transfer function is considered. Under the assumption that there exists a real number β < inf p(A) such that M(β)<< 0, it follows that β ε p(Lo). Applying a factorization result of A.I. Virozub and V.I. Matsaev [VM] to the holomorphic operator function M(λ, the_spectral subspaces of Lo corresponding to the intervals ] — ∞, β] and [β, ∞[ and the restrictions of Lo to these subspaces are characterized. Similar results are proved for operator matrices which are symmetric in a Krein space.  相似文献   

12.
Let x? be a computed solution to a linear system Ax=b with , where is a proper subclass of matrices in . A structured backward error (SBE) of x? is defined by a measure of the minimal perturbations and such that (1) and that the SBE can be used to distinguish the structured backward stability of the computed solution x?. For simplicity, we may define a partial SBE of x? by a measure of the minimal perturbation such that (2) Can one use the partial SBE to distinguish the structured backward stability of x?? In this note we show that the partial SBE may be much larger than the SBE for certain structured linear systems such as symmetric Toeplitz systems, KKT systems, and dual Vandermonde systems. Besides, certain backward errors for linear least squares are discussed. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   

13.
We prove the existence of infinitely many non-zero time-periodic solutions (breathers) to the dispersive wave equation of the form which are localized in the spatial variable, that is The main tool employed is the concentration compactness principle of P. L. Lions.  相似文献   

14.
Let D ? ?n be a bounded domain with piecewise-smooth boundary, and q(x,t) a smooth function on D × [0, T]. Consider the time-like Cauchy problem Given g, h for which the equation has a solution, we show how to approximate u(x,t) by solving a well posed fourth-order elliptic partial differential equation (PDE). We use the method of quasi-reversibility to construct the approximating PDE. We derive error estimates and present numerical results.  相似文献   

15.
We study the variational problem Where Ψ* is the increasing rearrangement of Ψ. An approximate problem is introduced which involves a variational problem with n free boundaries (n → ∞). Various estimates are established. In particular, when Ω is convex we show that the solution to the approximate problem is superharmonic and has bounded gradient.  相似文献   

16.
Let F(θ k, α) be the far field pattern arising from the scattering of a time harmonic plane acoustic wave of wave number k and direction a by a sound-soft cylinder of cross section D. Suppose F has the Fourier expansion where an = an(k, . Then if ?2 is a Dirichlet eigenvalue for D, sufficient conditions are given on D for the existence of a nontrivial sequence |bn| where the bn are independent of such that for all directions Domains for which this is true are called generalized Herglotz domains. The conditions for a domain to be a generalized Herglotz domain are given either in terms of the Schwarz function for the analytic boundary ?D or in terms of the Rayleigh hypothesis in acoustic scattering theory and examples are given showing the applicability of these conditions.  相似文献   

17.
A routing R of a graph G is a set of n(n ? 1) elementary paths R(u, v) specified for all ordered pairs (u, v) of vertices of G. The vertex-forwarding index ξ(G) of G, is defined by Where ξ(G, R) is the maximum number of paths of the routing R passing through any vertex of G and the minimum is taken over all the routings of G. Let Gp denote the random graph on n vertices with edge probability p and let m = np. It is proved among other things that, under natural growth conditions on the function p = p(n), the ratio Tends to 1 in probability as n tends to infinity.  相似文献   

18.
Bounds are determined for the Ramsey number of the union of graphs versus a fixed graph H, based on the Ramsey number of the components versus H. For certain unions of graphs, the exact Ramsey number is determined. From these formulas, some new Ramsey numbers are indicated. In particular, if . Where ki is the number of components of order i and t1 (H) is the minimum order of a color class over all critical colorings of the vertices of H, then .  相似文献   

19.
The isoperimetric constant of a graph G on n vertices, i(G), is the minimum of , taken over all nonempty subsets SV (G) of size at most n/2, where S denotes the set of edges with precisely one end in S. A random graph process on n vertices, , is a sequence of graphs, where is the edgeless graph on n vertices, and is the result of adding an edge to , uniformly distributed over all the missing edges. The authors show that in almost every graph process equals the minimal degree of as long as the minimal degree is o(log n). Furthermore, it is shown that this result is essentially best possible, by demonstrating that along the period in which the minimum degree is typically Θ(log n), the ratio between the isoperimetric constant and the minimum degree falls from 1 to , its final value. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008  相似文献   

20.
A system of nonlinear differential equations of the type on a domain of ?n is studied. Functional relations between the fj's, j = 1, …, n, and other necessary conditions are deduced when at each point of the domain the system has a manifold of local solutions. A structure theorem, that makes possible to reduce the problems of the system, e.g. the global solvability of it, to the corresponding questions for a connection of the type ?z?w = g(z, w) in a fibre bundle over a Riemann surface is proved, and through this reduction we obtain theorems of identity, extension, global factorization, and so on, for the solutions of the system. As an example, a system of nonlinear differential equations of the type is studied and its global solutions are constructed.  相似文献   

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

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