‎the purpose of this paper is to introduce a new mapping for a finite‎ ‎family of accretive operators and introduce an iterative algorithm‎ ‎for finding a common zero of a finite family of accretive operators‎ ‎in a real reflexive strictly convex banach space which has a‎ ‎uniformly g^ateaux differentiable norm and admits the duality‎ ‎mapping $j_{varphi}$‎, ‎where $varphi$ is a gauge function ...

in this paper, downlink resource allocation for a sparse code multiple access (scma) based heterogeneous  cellular networks (hcn) is investigated. the main aim of this paper is to obtain joint power allocation and codebook assignment to achieve the least total system transmit power. in this regard, the proposed objective function is formulated as total transmit power subject to users minimum ra...

We show that, if a building is endowed with its complete system of apartments, and if each panel is contained in at least four chambers, then the intersection of two apartments can be any convex subcomplex contained in an apartment. This combinatorial result is particularly interesting for lower dimensional convex subcomplexes of apartments, where we definitely need the assumption on the four c...

The following result of convex analysis is well–known [2]: If the function f : X → [−∞, +∞] is convex and some x0 ∈ core (dom f) satisfies f(x0) > −∞, then f never takes the value −∞. From a corresponding theorem for convex functions with values in semi–linear spaces a variety of results is deduced, among them the mentioned theorem, a theorem of Deutsch and Singer on the single–valuedness of co...

We define a convex extension of a lower-semicontinuous function to be a convex function that is identical to the given function over a pre-specified subset of its domain. Convex extensions are not necessarily constructible or unique. We identify conditions under which a convex extension can be constructed. When multiple convex extensions exist, we characterize the tightest convex extension in a...

We consider a digital fuzzy set placed in Oxyplane, with support which is a set of digital points (centroids) in Z. We consider two kinds of convexity of a fuzzy set, namely quasi convexity and strong convexity, and we propose two algorithms for the construction of both kinds of convex hull of a digital fuzzy set.

In this paper, we deal with the convex generators 1 of a graph G = (V(G),E(G)). A convex generator being a minimal set whose convex hull is V(G), we show that it is included in the "boundary" of G. Then we show that the "boundary" of a polymino's graph, or more precisely the seaweed's "boundary", enjoys some nice properties which permit us to prove that for such a graph G, the minimal size of a...

1. Introduction 2. Order and type in classical complex analysis 3. Relative order and type of convex functions 4. Order and type in duality 5. The infimal convolution 6. The order of an entire function 7. A geometric characterisation of the relative order 8. An extension problem for holomorphic functions 9. Whittaker's decomposition theorem 10. Inequalities for the infimal convolution 11. Inequ...

An empty pentagon in a point set P in the plane is a set of five points in P in strictly convex position with no other point of P in their convex hull. We prove that every finite set of at least 328` points in the plane contains an empty pentagon or ` collinear points. This is optimal up to a constant factor since the (` − 1) × (` − 1) grid contains no empty pentagon and no ` collinear points. ...

We consider the problem of minimizing a convex function plus a polynomial p over a convex body K. We give an algorithm that outputs a solution x whose value is within rangeK(p) of the optimum value, where rangeK(p) = supx∈K p(x)− infx∈K p(x). When p depends only on a constant number of variables, the algorithm runs in time polynomial in 1/ , the degree of p, the time to round K and the time to ...