A jump system is a set of integer points with an exchange property, which is a generalization of a matroid, a delta-matroid, and a base polyhedron of an integral polymatroid (or a submodular system). Recently, the concept of M-convex functions on constant-parity jump systems is introduced by Murota as a class of discrete convex functions that admit a local criterion for global minimality. M-con...

Some new Jensen’s type inequalities for di¤erentiable log-convex functions of selfadjoint operators in Hilbert spaces under suitable assumptions for the involved operators are given. Applications for particular cases of interest are also provided. 1. Introduction Jensen’s inequality for convex functions is one of the most important result in the Theory of Inequalities due to the fact that many ...

‎in this paper‎, ‎generalized convex contractions on orthogonal metric spaces are stablished in whath might be called their definitive versions‎. ‎also, we show that‎ there are examples which show that our main theorems are genuine generalizations of theorem 3.1 and 3.2 of cite{r}‎[ m.a. miandaragh, m. postolache, s. rezapour, ‎textit{approximate fixed points of generalizedconvex contractions},...

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

In this paper, we give the correlation and difference between M-convex fuzzy process and SLW-convex fuzzy process, and present some basic properties of these convex fuzzy processes, which improve some known results about the connection between those convex fuzzy processes and their graphs. In addition, we introduce a new notion of s-convex fuzzy process as a generalization of M-convex fuzzy pro...

We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more general class of objects – (β, δ)-covered objects – which are not necessarily convex, see definition below. These structures are more efficient than alternative known structures, because they exploit the fatness of the o...

The concepts of M-convex functions and M^-convex functions play central roles in the theory of discrete convex analysis which has been applied to mathematical economics. On the other hand, substitutability, which is a key property guaranteeing the existence of a stable matching in generalized stable marriage models, is known as a nice property in mathematical economics. In this paper, we introd...

This paper presents a faster algorithm for the M-convex submodular flow problem, which is a generalization of the minimum-cost flow problem with an M-convex cost function for the flow-boundary, where an M-convex function is a nonlinear nonseparable discrete convex function on integer points. The algorithm extends the capacity scaling approach for the submodular flow problem by Fleischer, Iwata ...