Search results for " inequality."
showing 10 items of 809 documents
An eigenvalue Dirichlet problem involving the p-Laplacian with discontinuous nonlinearities
2005
AbstractA multiplicity result for an eigenvalue Dirichlet problem involving the p-Laplacian with discontinuous nonlinearities is obtained. The proof is based on a three critical points theorem for nondifferentiable functionals.
Optimal shape design and unilateral boundary value problems: Part II
2007
In the first part we give a general existence theorem and a regularization method for an optimal control problem where the control is a domain in R″ and where the system is governed by a state relation which includes differential equations as well as inequalities. In the second part applications for optimal shape design problems governed by the Dirichlet-Signorini boundary value problem are presented. Several numerical examples are included.
New isoperimetric estimates for solutions to Monge - Ampère equations
2009
Abstract We prove some sharp estimates for solutions to Dirichlet problems relative to Monge–Ampere equations. Among them we show that the eigenvalue of the Dirichlet problem, when computed on convex domains with fixed measure, is maximal on ellipsoids. This result falls in the class of affine isoperimetric inequalities and shows that the eigenvalue of the Monge–Ampere operator behaves just the contrary of the first eigenvalue of the Laplace operator.
A sharp estimate of the extinction time for the mean curvature flow
2007
We establish a pointwise comparison result for a nonlinear degenerate elliptic Dirichlet problem using an isoperimetric inequality involving the total mean curvature. In particular this result provides a sharp estimate for the extinction time of a class of compact surfaces, wider than the convex one, moving by mean curvature flow. Finally we present numerical experiments to compare our estimate with those known in literature.
On Strong Convergence of Halpern’s Method for Quasi-Nonexpansive Mappings in Hilbert Spaces
2016
In this paper, we introduce a Halpern’s type method to approximate common fixed points of a nonexpansive mapping T and a strongly quasi-nonexpansive mappings S, defined in a Hilbert space, such that I − S is demiclosed at 0. The result shows as the same algorithm converges to different points, depending on the assumptions of the coefficients. Moreover, a numerical example of our iterative scheme is given.
On the cardinality of almost discretely Lindelof spaces
2016
A space is said to be almost discretely Lindelof if every discrete subset can be covered by a Lindelof subspace. Juhasz et al. (Weakly linearly Lindelof monotonically normal spaces are Lindelof, preprint, arXiv:1610.04506 ) asked whether every almost discretely Lindelof first-countable Hausdorff space has cardinality at most continuum. We prove that this is the case under $$2^{<{\mathfrak {c}}}={\mathfrak {c}}$$ (which is a consequence of Martin’s Axiom, for example) and for Urysohn spaces in ZFC, thus improving a result by Juhasz et al. (First-countable and almost discretely Lindelof $$T_3$$ spaces have cardinality at most continuum, preprint, arXiv:1612.06651 ). We conclude with a few rel…
Varieties of Codes and Kraft Inequality
2007
Decipherability conditions for codes are investigated by using the approach of Guzman, who introduced in [7] the notion of variety of codes and established a connection between classes of codes and varieties of monoids. The class of Uniquely Decipherable (UD) codes is a special case of variety of codes, corresponding to the variety of all monoids. It is well known that the Kraft inequality is a necessary condition for UD codes, but it is not sufficient, in the sense that there exist codes that are not UD and that satisfy the Kraft inequality. The main result of the present paper states that, given a variety V of codes, if all the elements of V satisfy the Kraft inequality, then V is the var…
Varieties of Codes and Kraft Inequality
2005
Decipherability conditions for codes are investigated by using the approach of Guzman, who introduced in [7] the notion of variety of codes and established a connection between classes of codes and varieties of monoids. The class of Uniquely Decipherable (UD) codes is a special case of variety of codes, corresponding to the variety of all monoids. It is well known that the Kraft inequality is a necessary condition for UD codes, but it is not sufficient, in the sense that there exist codes that are not UD and that satisfy the Kraft inequality. The main result of the present paper states that, given a variety $\mathcal{V}$ of codes, if all the elements of $\mathcal{V}$ satisfy the Kraft inequ…
Sobolev embeddings, extensions and measure density condition
2008
AbstractThere are two main results in the paper. In the first one, Theorem 1, we prove that if the Sobolev embedding theorem holds in Ω, in any of all the possible cases, then Ω satisfies the measure density condition. The second main result, Theorem 5, provides several characterizations of the Wm,p-extension domains for 1<p<∞. As a corollary we prove that the property of being a W1,p-extension domain, 1<p⩽∞, is invariant under bi-Lipschitz mappings, Theorem 8.
The Besov capacity in metric spaces
2016
We study a capacity theory based on a definition of Haj{\l} asz-Besov functions. We prove several properties of this capacity in the general setting of a metric space equipped with a doubling measure. The main results of the paper are lower bound and upper bound estimates for the capacity in terms of a modified Netrusov-Hausdorff content. Important tools are $\gamma$-medians, for which we also prove a new version of a Poincar\'e type inequality.