نتایج جستجو برای: continuous g
تعداد نتایج: 690110 فیلتر نتایج به سال:
Various types of primeness have been considered for near-rings. One of these is the concept of equiprime, which was defined in 1990 by Booth, Groenewald and Veldsman. We will investigate when the near-ring N0(G) of continuous zeropreserving self maps of a topological group G is equiprime. This is the case when G is either T0 and 0-dimensional or T0 and arcwise connected. We also give conditions...
An N-dimensional real representation E of a finite group G is said to have the “Borsuk-Ulam Property” if any continuous G-map from the (N + 1)-fold join of G (an N-complex equipped with the diagonal G-action) to E has a zero. This happens iff the “Van Kampen characteristic class” of E is nonzero, so using standard computations one can explicitly characterize representations having the B-U prope...
and Applied Analysis 3 provided this limit exists. A function f : T → R is said to be rd-continuous provided f is continuous at right-dense points and there exists a finite left limit at all left-dense points in T .The set of all such rd-continuous functions is denoted by Crd(T).The derivativef Δ off and the forward jump operator σ are related by the formula f σ (t) = f (σ (t)) = f (t) + μ (t) ...
Conductive textile yarns were prepared by a continuous vapor polymerization method; the application of polypyrrole by the continuous vapor polymerisation method used is designed for the easy adaptation into industrial procedures. The resultant conductive yarns were examined by longitudinal and cross-sectional views, clearly showing the varying level of penetration of the polymer into the yarns ...
Let Γ be a discrete subgroup of a simply connected, solvable Lie group G, such that AdG Γ has the same Zariski closure as AdG. If α : Γ → GLn(R) is any finite-dimensional representation of Γ, we show that α virtually extends to a continuous representation σ of G. Furthermore, the image of σ is contained in the Zariski closure of the image of α. When Γ is not discrete, the same conclusions are t...
where / is a mapping of X into its adjoint space X* such that for all u in X, (J(u)} ^)=|M| 2 d ||/(^)|| HMI* In some recent papers ([7], [8], [9]), we have presented an existence theory for solutions of nonlinear functional equations in uniformly convex Banach spaces X involving nonexpansive and accretive mappings. These results were obtained by interweaving the fixed point theory of nonexpans...
If f : [0, 1] → R is strictly increasing and continuous define Tfx = f(x) (mod 1). A transformation T̃ : [0, 1] → [0, 1] is called ε-close to Tf , if T̃ x = f̃(x) (mod 1) for a strictly increasing and continuous function f̃ : [0, 1] → R with ‖f̃ − f‖∞ < ε. It is proved that the topological pressure p(Tf , g) is lower semi-continuous, and an upper bound for the jumps up is given. Furthermore the cont...
context-dependent modeling is a well-known approach to increase modeling accuracy in continuous speech recognition. the most common way to implement this approach is via triphone modeling. nevertheless, the large number of such models results in several problems in model training, whilst the robust training of such models is often hardly obtained. one approach to solve this problem is via param...
Let f(t) be a real continuous function on an interval, and consider the operator function f(X) defined for Hermitian operators X. We will show that if f(X) is increasing w.r.t. the operator order, then for F (t) = ∫ f(t)dt the operator function F (X) is convex. Let h(t) and g(t) be C1 functions defined on an interval I. Suppose h(t) is non-decreasing and g(t) is increasing. Then we will define ...
A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic number of a graph G, denoted by χb(G), is the maximum number t such that G admits a bcoloring with t colors. A graph G is b-continuous if it admits a b-coloring with t colors, for every t = χ(G), . . . , χb(G). We defi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید