the purpose of this paper is to obtain necessary and suffcient conditionsfor existence approximate fixed point on geraghty-contraction. in this paper,denitions of approximate -pair fixed point for two maps tα , sα and theirdiameters are given in a metric space.

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...

Convexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle path convexity in graphs. Unlike minimal path convexities, the Helly and Radon numbers behave almost uniformly for triangle path convexity. c © 1999 Elsevier Science B.V. All rights reserved

In this paper I estimate the inflation risk premium (IRP) using a low- dimensional arbitrage free dynamic model through novel strategy. Instead of modeling nominal and real yields jointly, make assumptions about short-term rate. More specifically, assume it follows Gaussian process. This framework has closed-form expression for IRP. Since are not observed, to parameters approximate them by brea...

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...

Let N denote the set of non-negative integers. A set of non-negative, n-dimensional integral vectors, M ⊂ N, is said to be right-closed, if ((x ∈ M) ∧ (y ≥ x) ∧ (y ∈ N)) ⇒ (y ∈ M). In this paper, we present a polynomial time algorithm for testing the convexity of a right-closed set of integral vectors, when the dimension n is fixed. Right-closed set of integral vectors are infinitely large, by ...

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...