نتایج جستجو برای: ‎F--convex set

تعداد نتایج: 969749  

‎We use of two notions functionally convex (briefly‎, ‎F--convex) and functionally closed (briefly‎, ‎F--closed) in functional analysis and obtain more results‎. ‎We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$‎, ‎then $bigcup_{alphain I}A_{alpha}$ is F--convex‎. ‎Moreover‎, ‎we introduce new definition o...

Journal: :international journal of industrial mathematics 2014
a. razani

the notion of a bead metric space is defined as a nice generalization of the uniformly convex normed space such as $cat(0)$ space, where the curvature is bounded from above by zero. in fact, the bead spaces themselves can be considered in particular as natural extensions of convex sets in uniformly convex spaces and normed bead spaces are identical with uniformly convex spaces. in this paper, w...

The notion of a bead metric space is defined as a nice generalization of the uniformly convex normed space such as $CAT(0)$ space, where the curvature is bounded from above by zero. In fact, the bead spaces themselves can be considered in particular as natural extensions of convex sets in uniformly convex spaces and normed bead spaces are identical with uniformly convex spaces. In this paper, w...

Journal: :international journal of nonlinear analysis and applications 2015
madjid eshaghi hamidreza reisi dezaki alireza moazzen

‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...

2005
John Williamson

1 For a description of this process and an explicit expression of the elements of T, see A. Wintner, Spektraltheorie der unendlichen matrizen, 1929, pp. 32-61. 2 These PROCEEDINGS, 17, 676-678 (1931). 8 This fact was pointed out to me by Dr. John Williamson of this department. This particular form of statement is convenient in a solution of the problem of determining the region of the complex p...

Journal: :journal of sciences islamic republic of iran 0

in this paper, we investigate the concept of topological stationary for locally compact semigroups. in [4], t. mitchell proved that a semigroup s is right stationary if and only if m(s) has a left invariant mean. in this case, the set of values ?(f) where ? runs over all left invariant means on m(s) coincides with the set of constants in the weak* closed convex hull of right translates of f. th...

1991
Boris Aronov Micha Sharir

Let H be a collection of n hyperplanes in IR d , let A denote the arrangement of H; and let be a (d ? 1)-dimensional algebraic surface of low degree, or the boundary of a convex set in IR d. The zone of in A is the collection of cells of A crossed by. We show that the total number of faces bounding the cells of the zone of is O(n d?1 log n). More generally, if has dimension p, 0 p < d, this qua...

Journal: :communication in combinatorics and optimization 0
m. dettlaff gdańsk university of technology s. kosari azarbaijan shahid madani university m. lemańska gdańsk university of technology s.m. sheikholeslami azarbaijan shahid madani university

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

Journal: :communication in combinatorics and optimization 0
m. dettlaff gdańsk university of technology s. kosari azarbaijan shahid madani university m. lemańska gdańsk university of technology s.m. sheikholeslami azarbaijan shahid madani university

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

Journal: :bulletin of the iranian mathematical society 2015
m. darus i. aldawish r. w. ibrahim

let $c_0(alpha)$ denote the class of concave univalent functions defined in the open unit disk $mathbb{d}$. each function $f in c_{0}(alpha)$ maps the unit disk $mathbb{d}$ onto the complement of an unbounded convex set. in this paper, we study the mapping properties of this class under integral operators.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید