Search results for "LIMIT"
showing 10 items of 2826 documents
On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian
2012
Abstract This paper concerns the best Lipschitz extension problem for a discrete distance that counts the number of steps. We relate this absolutely minimizing Lipschitz extension with a discrete ∞-Laplacian problem, which arises as the dynamic programming formula for the value function of some e -tug-of-war games. As in the classical case, we obtain the absolutely minimizing Lipschitz extension of a datum f by taking the limit as p → ∞ in a nonlocal p -Laplacian problem.
On the solutions to 1-Laplacian equation with L1 data
2009
AbstractIn the present paper we study the behaviour, as p goes to 1, of the renormalized solutions to the problems(0.1){−div(|∇up|p−2∇up)=finΩ,up=0on∂Ω, where p>1, Ω is a bounded open set of RN (N⩾2) with Lipschitz boundary and f belongs to L1(Ω). We prove that these renormalized solutions pointwise converge, up to “subsequences,” to a function u. With a suitable definition of solution we also prove that u is a solution to a “limit problem.” Moreover we analyze the situation occurring when more regular data f are considered.
Bounded elements of C*-inductive locally convex spaces
2013
The notion of bounded element of C*-inductive locally convex spaces (or C*-inductive partial *-algebras) is introduced and discussed in two ways: The first one takes into account the inductive structure provided by certain families of C*-algebras; the second one is linked to the natural order of these spaces. A particular attention is devoted to the relevant instance provided by the space of continuous linear maps acting in a rigged Hilbert space.
Amount of Nonconstructivity in Finite Automata
2009
When D. Hilbert used nonconstructive methods in his famous paper on invariants (1888), P.Gordan tried to prevent the publication of this paper considering these methods as non-mathematical. L. E. J. Brouwer in the early twentieth century initiated intuitionist movement in mathematics. His slogan was "nonconstructive arguments have no value for mathematics". However, P. Erdos got many exciting results in discrete mathematics by nonconstructive methods. It is widely believed that these results either cannot be proved by constructive methods or the proofs would have been prohibitively complicated. R.Freivalds [7] showed that nonconstructive methods in coding theory are related to the notion of…
Fixed point theorems for non-self mappings in symmetric spaces under φ-weak contractive conditions and an application to functional equations in dyna…
2014
In this paper, we prove some common fixed point theorems for two pairs of non-self weakly compatible mappings enjoying common limit range property, besides satisfying a generalized phi-weak contractive condition in symmetric spaces. We furnish some illustrative examples to highlight the realized improvements in our results over the corresponding relevant results of the existing literature. We extend our main result to four finite families of mappings in symmetric spaces using the notion of pairwise commuting mappings. Finally, we utilize our results to discuss the existence and uniqueness of solutions of certain system of functional equations arising in dynamic programming.
Homotopy limits for 2-categories
2008
AbstractWe study homotopy limits for 2-categories using the theory of Quillen model categories. In order to do so, we establish the existence of projective and injective model structures on diagram 2-categories. Using these results, we describe the homotopical behaviour not only of conical limits but also of weighted limits. Finally, pseudo-limits are related to homotopy limits.
Learning with confidence
1996
Herein we investigate learning in the limit where confidence in the current conjecture accrues with time. Confidence levels are given by rational numbers between 0 and 1. The traditional requirement that for learning in the limit is that a device must converge (in the limit) to a correct answer. We further demand that the associated confidence in the answer (monotonically) approach 1 in the limit. In addition to being a more realistic model of learning, our new notion turns out to be a more powerful as well. In addition, we give precise characterizations of the classes of functions that are learnable in our new model(s).
Internal inverse limits and retractions
2015
We establish equivalences between compacta that admit a sequence of retractions that converge uniformly to the identity map and compacta that are inverse limits on subcompacta with retractions for bonding maps. We give partial answers to questions of Charatonik and Prajs, and of Krasinkiewicz. Our results are related to and use results from another paper of the authors \cite{mp}.
Some Integral Type Fixed-Point Theorems and an Application to Systems of Functional Equations
2013
In this paper, we prove a new common fixed point theorem for four self mappings by using the notions of compatibility and subsequential continuity (alternate subcompatibility and reciprocal continuity) in metric spaces satisfying a general contractive condition of integral type. We give some examples to support the useability of our main result. Also, we obtain some fixed point theorems of Gregus type for four mappings satisfying a strict general contractive condition of integral type in metric spaces. We conclude the paper with an application of our main result to solvability of systems of functional equations.
Fixed points of weakly compatible mappings satisfying generalized $\varphi$-weak contractions
2014
In this paper, utilizing the notion of the common limit range property, we prove some new integral type common fixed point theorems for weakly compatible mappings satisfying a \(\varphi \)-weak contractive condition in metric spaces. Moreover, we extend our results to four finite families of self mappings, and furnish an illustrative example and an application to support our main theorem. Our results improve, extend, and generalize well-known results on the topic in the literature.