In the present paper, we introduce and study a fuzzy vector equilibrium problem and prove some existence results with and without convexity assumptions by using some particular forms of results of textit{Kim} and textit{Lee} [W.K. Kim and K.H. Lee, Generalized fuzzy games and fuzzy equilibria, Fuzzy Sets and Systems, 122 (2001), 293-301] and textit{Tarafdar} [E. Tarafdar, Fixed point theorems i...

Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...

A restricted-orientation convex set, also called an O-convex set, is a set of points whose intersection with lines from some xed set is empty or connected. The notion of O-convexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O-convex sets in two and higher dimensions. We also study O-connected sets, which are restricted O-convex sets with...

Gordon G Johnson* ([email protected]), Department of Mathematics, University of Houston, Houston, TX 77204-3008. The Closure in a Hilbert Space of a PreHilbert Space CHEBYSHEV Set Fails to be a CHEBYSHEV Set. Preliminary report. E is the real inner product space that is union of all finite-dimensional Euclidean spaces, S is a certain bounded nonconvex set in the E having the property that every...

The generalization of classical results about convex sets in Rn to abstract convexity spaces, defined by sets of paths in graphs, leads to many challenging structural and algorithmic problems. Here we study the Radon number for the P3-convexity on graphs. A set R of vertices of a graph G is P3-convex if no vertex in V (G) \ R has two neighbours in R. The P3-convex hull of a set of vertices is t...

Numeric abstract domains are key to many verification problems. Their ability to scale hinges on using convex approximations of the possible variable valuations. In certain cases, this approximation is too coarse to verify certain verification conditions, namely those that require disjunctive invariants. A common approach to infer disjunctive invariants is to track a set of states. However, thi...

Abstract. Optimal control problems of forward-backward stochastic Volterra integral equations (FBSVIEs, in short) with closed control regions are formulated and studied. Instead of using spike variation method as one may imagine, here we turn to treat the non-convexity of the control regions by borrowing some tools in set-valued analysis and adapting them into our stochastic control systems. A ...

Abstract The main aim of this article is to present some novel geometric properties for three distinct normalizations the generalized k k -Bessel functions, such as radii uniform convexity and α \alpha -convexity. In addition, we show that -convexity remain in between starlikeness convexity, case when <m:m...

* Correspondence: [email protected] Department of Mathematics, University of Karachi, University Road, Karachi, Pakistan Full list of author information is available at the end of the article Abstract In this article, we give more generalized results than in Anwar et al. (2010) and Latif and Pečarić (2010) in new direction by using second-order divided difference. We investigate the expone...

An abstract convexity space on a connected hypergraph H with vertex set V (H) is a family C of subsets of V (H) (to be called the convex sets of H) such that: (i) C contains the empty set and V (H), (ii) C is closed under intersection, and (iii) every set in C is connected in H. A convex set X of H is a minimal vertex convex separator of H if there exist two vertices of H that are separated by ...