Correspondence: gaoyingimu@163. com Department of Mathematics, Chongqing Normal University, Chongqing 400047, China Abstract In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, a, r, d)-convexity, which extends some kinds of generalized convexity, such as second or...

Inspired by locale theory, we propose “pointfree convex geometry.” We introduce the notion of convexity algebra as pointfree convexity space. There are two notions of point for convexity algebra: one is chain-prime meet-complete filter and the other is maximal meet-complete filter. In this paper we show the following: (1) the former notion of point induces a dual equivalence between the categor...

It is our purpose to establish some new characterizations of convex sets by means of local properties and to derive as a consequence certain known results. This will be done for sets in a topological linear space 7, such a space being a real linear space with a Hausdorff topology such that the operations of vector addition x+y and scalar multiplication ax are continuous in both variables jointl...

It is shown that a collapsible, compact, connected, simplicial polyhedron admits a cubical subdivision and a median convexity, such that all cubes are convex subspaces with a convexity of subcubes. Conversely, a compact, connected, cubical polyhedron with a convexity as described admits a collapsible simplicial subdivision. Such a convexity, when it exists, is uniquely determined by the corresp...

A fundamental problem in number theory is to estimate the values of L-functions at the center of the critical strip. The Langlands program predicts that all L-functions arise from automorphic representations of GL(N) over a number field, and moreover that such L-functions can be decomposed as a product of primitive L-functions arising from irreducible cuspidal representations of GL(n) over Q. T...

In this note we introduce the notion of Grassmann convexity analogous to the wellknown notion of convexity for curves in real projective spaces. We show that the curve in G2,4 osculating to a convex closed curve in P is Grassmann-convex. This proves that the tangent developable (i.e. the hypersurface formed by all tangents) of any convex curve in P has the ‘degree’ equal to 4. Here by ‘degree’ ...

The paper studies both the convexity and average-convexity properties for a particular class of cooperative TU-games called common pool games. The common pool situation involves a cost function as well as a (weakly decreasing) average joint production function. Firstly, it is shown that, if the relevant cost function is a linear function, then the common pool games are convex games. The convexi...

In this paper, the order of convexity z2F1(a,b;c;z) is given under certain conditions on positive real parameters a, b and c. We show also that image domains unit disc D some shifted zero-balanced hypergeometric functions z2F1(a,b;a+b;z) are convex bounded by two horizontal lines. This solves a problem raised Ponnusamy Vuorinen in [10].