首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Let u(z,G) be the classical warping function of a simply connected domain G. We prove that the L p -norms of the warping function with different exponents are related by a sharp isoperimetric inequality, including the functional u(G) = sup x∈G u(x, G). A particular case of our result is the classical Payne inequality for the torsional rigidity of a domain. On the basis of the warping function, we construct a new physical functional possessing the isoperimetric monotonicity property. For a class of integrals depending on the warping function, we also obtain a priori estimates in terms of the L p -norms of the warping function as well as the functional u(G). In the proof, we use the estimation technique on level lines proposed by Payne.  相似文献   

2.
Let G be a simply connected domain and let u(x,G) be its warping function. We prove that L p -norms of functions u and u ?1 are monotone with respect to the parameter p. This monotony also gives isoperimetric inequalities for norms that correspond to different values of the parameter p. The main result of this paper is a generalization of classical isoperimetric inequalities of St.Venant-Pólya and the Payne inequalities.  相似文献   

3.
Let u(x,G) be the stress function of a multiply connected plane domain G. We construct new domain functionals depending on this stress function which are isoperimetrically monotone with respect to the free parameter. A particular case of the proved result is the Payne inequality for the torsional rigidity of G.  相似文献   

4.
We consider integral functionals of a simply connected domain which depend on the distance to the domain boundary. We prove an isoperimetric inequality generalizing theorems derived by the Schwarz symmetrization method. For L p -norms of the distance function we prove an analog of the Payne inequality for the torsional rigidity of the domain. In compare with the Payne inequality we find new extremal domains different from a disk.  相似文献   

5.
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg vn – 1 – p(n) for every edge uv of G, where p(n) = 0 if n is even and p(n) = 1 if n is odd. Here it is shown that the bound n – 1 – p(n) can be decreased to (2n + 1)/3 if every bridge of G is incident with a vertex of degree 1, which is a necessary condition for hamiltonicity of L(G). Moreover, the conclusion that L(G) is hamiltonian can be strengthened to the conclusion that L(G) is pancyclic. Lesniak-Foster and Williamson proved that G contains a spanning closed trail if |V(G)| = n ≥ 6, δ(G) ≥ 2 and deg u + deg vn – 1 for every pair of nonadjacent vertices u and v. The bound n – 1 can be decreased to (2n + 3)/3 if G is connected and bridgeless, which is necessary for G to have a spanning closed trail.  相似文献   

6.
In this paper we study the existence of solutions u \({{W}^{1,p}_{0}}\) (Ω) with △ p uL 2(Ω) for the Dirichlet problem 1 $$ \left\{ \begin{array} [c]{l}-\triangle_{p}u\left( x\right) \in-\partial{\Phi}\left( u\left( x\right) \right) +G\left( x,u\left( x\right) \right) ,x\in{\Omega},\\ u\mid_{\partial{\Omega}}=0, \end{array} \right. $$ where Ω ? R N is a bounded open set with boundary ?Ω, △ p stands for the p?Laplace differential operator, ?Φ denotes the subdifferential (in the sense of convex analysis) of a proper convex and lower semicontinuous function Φ and G : Ω × R → 2R is a multivalued map. We prove two existence results: the first one deals with the case where the multivalued map u ? G(x, u) is upper semicontinuous with closed convex values and the second one deals with the case when u ? G(x, u) is lower semicontinuous with closed (not necessarily convex) values.  相似文献   

7.
The equation ut=Δp(u1/(p−1)) for p>1 is a nonlinear generalization of the heat equation which is also homogeneous, of degree 1. For large time asymptotics, its links with the optimal Lp-Euclidean logarithmic Sobolev inequality have recently been investigated. Here we focus on the existence and the uniqueness of the solutions to the Cauchy problem and on the regularization properties (hypercontractivity and ultracontractivity) of the equation using the Lp-Euclidean logarithmic Sobolev inequality. A large deviation result based on a Hamilton-Jacobi equation and also related to the Lp-Euclidean logarithmic Sobolev inequality is then stated.  相似文献   

8.
Denote by L a second order strongly elliptic operator in the Euclidian p-space Rp, and by P some real polynomial in one variable. First the wholespace-problem for the equation P(L)u = f is considered and asymptotic conditions are derived which yield an existence and uniqueness theorem. Then for the Dirichlet problem in some exterior domain G ? Rp a “Fredholm alternative theorem” is proved.  相似文献   

9.
10.
An L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-negative integers {0,1,…,λ} such that |f(u)−f(v)|≥p if u and v are adjacent, and |f(u)−f(v)|≥q if u and v are at distance 2 apart. The minimum value of λ for which G has L(p,q)-labeling is denoted by λp,q(G). The L(p,q)-labeling problem is related to the channel assignment problem for wireless networks.In this paper, we present a polynomial time algorithm for computing L(p,q)-labeling of a bipartite permutation graph G such that the largest label is at most (2p−1)+q(bc(G)−2), where bc(G) is the biclique number of G. Since λp,q(G)≥p+q(bc(G)−2) for any bipartite graph G, the upper bound is at most p−1 far from optimal.  相似文献   

11.
With each nonempty graph G one can associate a graph L(G), called the line graph of G, with the property that there exists a one-to-one correspondence between E(G) and V(L(G)) such that two vertices of L(G) are adjacent if and only if the corresponding edges of G are adjacent. For integers m ≥ 2, the mth iterated line graph Lm(G) of G is defined to be L(Lm-1(G)). A graph G of order p ≥ 3 is n-Hamiltonian, 0 ≤ np ? 3, if the removal of any k vertices, 0 ≤ kn, results in a Hamiltonian graph. It is shown that if G is a connected graph with δ(G) ≥ 3, where δ(G) denotes the minimum degree of G, then L2(G) is (δ(G) ? 3)-Hamiltonian. Furthermore, if G is 2-connected and δ(G) ≥ 4, then L2(G) is (2δ(G) ? 4)-Hamiltonian. For a connected graph G which is neither a path, a cycle, nor the graph K(1, 3) and for any positive integer n, the existence of an integer k such that Lm(G) is n-Hamiltonian for every mk is exhibited. Then, for the special case n = 1, bounds on (and, in some cases, the exact value of) the smallest such integer k are determined for various classes of graphs.  相似文献   

12.
Given a graph G, the m-step graph of G, denoted by S m (G), has the same vertex set as G and an edge between two distinct vertices u and v if there is a walk of length m from u to v. The line graph of G, denoted by L(G), is a graph such that the vertex set of L(G) is the edge set of G and two vertices u and v of L(G) are adjacent if the edges corresponding to u and v share a common end vertex in G. We characterize connected graphs G such that S m (G) and L(G) are isomorphic.  相似文献   

13.
For an integer i, a graph is called an Li-graph if, for each triple of vertices u, v, w with d(u, v) = 2 and w (element of) N(u) (intersection) N(v), d(u) + d(v) ≥ | N(u) (union) N(v) (union) N(w)| —i. Asratian and Khachatrian proved that connected Lo-graphs of order at least 3 are hamiltonian, thus improving Ore's Theorem. All K1,3-free graphs are L1-graphs, whence recognizing hamiltonian L1-graphs is an NP-complete problem. The following results about L1-graphs, unifying known results of Ore-type and known results on K1,3-free graphs, are obtained. Set K = lcub;G|Kp,p+1 (contained within) G (contained within) Kp V Kp+1 for some ρ ≥ } (v denotes join). If G is a 2-connected L1-graph, then G is 1-tough unless G (element of) K. Furthermore, if G is as connected L1-graph of order at least 3 such that |N(u) (intersection) N(v)| ≥ 2 for every pair of vertices u, v with d(u, v) = 2, then G is hamiltonian unless G ϵ K, and every pair of vertices x, y with d(x, y) ≥ 3 is connected by a Hamilton path. This result implies that of Asratian and Khachatrian. Finally, if G is a connected L1-graph of even order, then G has a perfect matching. © 1996 John Wiley & Sons, Inc.  相似文献   

14.
Let G be the group ${{\rm SL}(2, \mathbb{R})}$ . For this group we prove a version of Schwartz’s theorem on spectral analysis for the group G. We find the sharp range of Lebesgue spaces L p (G) for which a smooth function is not mean periodic unless it is a cusp form. Failure of the Schwartz-like theorem is also proved when C (G) is replaced by L p (G) with suitable p. We show that the last result is linked with the failure of the Wiener-tauberian theorem for G.  相似文献   

15.
16.
In this paper, we describe the range of the Lp-norm of a function under fixed Lp-norms with two other different exponents p and under a natural multiplicative restriction of the type of the Muckenhoupt condition. Particular cases of such results are simple inequalities as the interpolation inequality between two Lp-norms as well as such nontrivial inequalities as the Gehring inequality or the reverse H?lder inequality for Mackenhoupt weights. The basic method of our paper is the search for the exact Bellman function of the corresponding extremal problem. Bibliography: 5 Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 355, 2008, pp. 81–138.  相似文献   

17.
The author proved in [3] that every translation-invariant linear form on D(Rn), as well as on other spaces of test functions and distributions, is necessarily continuous. The same result has also been proved for the Hilbert space L2(G) where G is a compact connected Abelian group. In contrast to this it is proved here that there do exist discontinuous translation-invariant linear forms on the Banach spaces l1(Z) and L1(R), and on the Hibert spaces L2(D) and L2(R). Here Z denotes the additive group of the integers, D denotes the totally disconnected compact Abelian Cantor discontinuum group, and R denotes the additive group of the real numbers. The proofs divide into two parts: A general criterion (Theorem 1) and proofs that the spaces l1(Z), L2(D), L2(R), and L1(R) satisfy this criterion (Theorems 2, 3, 4, and 5, respectively).  相似文献   

18.
Let G be a bounded subset of Rn with a smooth boundary and Q = G × (0, T]. We consider a control problem governed by the Sobolev initial-value problem Myt(u) + Ly(u) = u in L2(Q), y(·, 0; u) = 0 in L2(G), where M = M(x) and L = L(x) are symmetric uniformly strongly elliptic operators of orders 2m and 2l, respectively. The problem is to find the control u0 of L2(Q)-norm at most b that steers to within a prescribed tolerance ? of a given function Z in L2(G) and that minimizes a certain energy functional. Our main results establish regularity properties of u0. We also give results concerning the existence and uniqueness of the optimal control, the controllability of Sobolev initial-value problems, and properties of the Lagrange multipliers associated with the problem constraints.  相似文献   

19.
We study the first cohomology groups of a countable discrete group G with coefficients in a G-module ?Φ(G), where Φ is an N-function of class Δ2(0) ∩ ?2(0). Developing the ideas of Puls and Martin-Valette for a finitely generated group G, we introduce the discrete Φ-Laplacian and prove a theorem on the decomposition of the space of Φ-Dirichlet finite functions into the direct sum of the spaces of Φ-harmonic functions and ?Φ(G) (with an appropriate factorization). We prove also that if a finitely generated group G has a finitely generated infinite amenable subgroup with infinite centralizer then \(\bar H^1\) (G, ?Φ(G)) = 0. In conclusion, we show the triviality of the first cohomology group for the wreath product of two groups one of which is nonamenable.  相似文献   

20.
Our aim in this note is to deal with boundary limits of monotone Sobolev functions with ▽u∈ Lp(·)logLq(·)(B) for the unit ball BRn. Here p(·) and q(·) are variable exponents satisfyingthe log-Hlder and the log log-Hlder conditions, respectively.  相似文献   

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

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