نتایج جستجو برای: strictly pseudononspreadingmappings
تعداد نتایج: 32713 فیلتر نتایج به سال:
We discuss two facets of the interaction between geometry and algebra in Banach algebras. In class unital algebras, there is essentially one known example which also strictly convex as a space. recall this example, finite-dimensional, consider open question generalising it to infinite dimensions. C*-algebras, we exhibit striking tighter relationship that exists there.
let $omega_x$ be a bounded, circular and strictly convex domain of a banach space $x$ and $mathcal{h}(omega_x)$ denote the space of all holomorphic functions defined on $omega_x$. the growth space $mathcal{a}^omega(omega_x)$ is the space of all $finmathcal{h}(omega_x)$ for which $$|f(x)|leqslant c omega(r_{omega_x}(x)),quad xin omega_x,$$ for some constant $c>0$, whenever $r_{omega_x}$ is the m...
Let $Omega_X$ be a bounded, circular and strictly convex domain of a Banach space $X$ and $mathcal{H}(Omega_X)$ denote the space of all holomorphic functions defined on $Omega_X$. The growth space $mathcal{A}^omega(Omega_X)$ is the space of all $finmathcal{H}(Omega_X)$ for which $$|f(x)|leqslant C omega(r_{Omega_X}(x)),quad xin Omega_X,$$ for some constant $C>0$, whenever $r_{Omega_X}$ is the M...
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them as inductive families. Strictly positive types (SPTs) form a grammar for defining inductive types and, consequently, a fundamental question in the the theory of inductive families is what constitutes a corresponding gr...
This paper characterizes a subclass of subsequential string-to-string functions called Output Strictly Local (OSL) and presents a learning algorithm which provably learns any OSL function in polynomial time and data. This algorithm is more efficient than other existing ones capable of learning this class. The OSL class is motivated by the study of the nature of string-to-string transformations,...
We present a strictly lexical parsing model where all the parameters are based on the words. This model does not rely on part-of-speech tags or grammatical categories. It maximizes the conditional probability of the parse tree given the sentence. This is in contrast with most previous models that compute the joint probability of the parse tree and the sentence. Although the maximization of join...
in a real hilbert space, an iterative scheme is considered to obtain strong convergence which is an essential tool to find a common fixed point for a countable family of nonexpansive mappings and the solution of a variational inequality problem governed by a monotone mapping. in this paper, we give a procedure which results in developing shehu's result to solve equilibrium prob...
We prove the absence of non-scattering energies for potentials in the plane having a corner of angle smaller than π. This extends the earlier result of Bl̊asten, Päivärinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential with a circular conic corner whose opening angle is outside a countable subset of (0, π).
We introduce container functors as a representation of data types providing a new conceptual analysis of data structures and polymorphic functions. Our development exploits Type Theory as a convenient way to define constructions within locally cartesian closed categories. We show that container morphisms can be full and faithfully interpreted as polymorphic functions (i.e. natural transformatio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید