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

We will be concerned with linear positive maps φ : Mm(C) → Mn(C). To fix notation we begin with setting up the notation and the relevant terminology (cf. [7]). We say that φ is positive if φ(A) is a positive element in Mn(C) for every positive matrix from Mm(C). If k ∈ N, then φ is said to be k-positive (respectively k-copositive) whenever [φ(Aij)] k i,j=1 (respectively [φ(Aji)] k i,j=1) is pos...

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

The purpose of this paper is to propose a compositeiterative scheme for approximating a common solution for a finitefamily of m-accretive operators in a strictly convex Banach spacehaving a uniformly Gateaux differentiable norm. As a consequence,the strong convergence of the scheme for a common fixed point ofa finite family of pseudocontractive mappings is also obtained.

‎Let $A_{i},B_{i},X_{i},i=1,dots,m,$ be $n$-by-$n$ matrices such that $‎sum_{i=1}^{m}leftvert A_{i}rightvert ^{2}$ and $‎sum_{i=1}^{m}leftvert B_{i}rightvert ^{2}$  are nonzero matrices and each $X_{i}$ is‎ ‎positive semidefinite‎. ‎It is shown that if $f$ is a nonnegative increasing ‎convex function on $left[ 0,infty right) $ satisfying $fleft( 0right)‎ ‎=0 $‎, ‎then  $$‎2s_{j}left( fleft( fra...

In this article we present a fuzzy logic based method for the construction of thoughts of artificial animals (animats). Due to the substantial increase of the processing power of personal computers in the last decade there was a notable progress in the field of animat construction and simulation. Regardless of the achieved results, the coding of the animat’s behaviour is very inaccurate and can...

In this paper we analyze the structure of some sets of moments of elements in a finite von Neumann algebra M . If the fundamental group of M is R+\{0}, then the moment sets are convex, and if M is isomorphic to M ⊗M , then the sets are closed under pointwise multiplication. We introduce a class of discrete groups that we call hyperlinear. These are the (infinite conjugacy classes) discrete subg...

Let V be a finite set andM a finite collection of subsets of V . ThenM is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. If M is an alignment of V , then the elements of M are called convex sets and the pair (V,M) is called an aligned space or a convexity space. If S ⊆ V , then the convex hull of S, denoted by CH(S), is the smalles...

In this paper we analyze the structure of some sets of non-commutative moments of elements in a finite von Neumann algebra M . If the fundamental group of M is R+\{0}, then the moment sets are convex, and if M is isomorphic to M ⊗M , then the sets are closed under pointwise multiplication. We introduce a class of discrete groups that we call hyperlinear. These are the discrete subgroups (with i...

Let M = G/K be a Riemannian homogeneous manifold with dimCG C = dimRG , where G C denotes the universal complexification of G. Under certain extensibility assumptions on the geodesic flow of M , we give a characterization of the maximal domain of definition in TM for the adapted complex structure and show that it is unique. For instance, this can be done for generalized Heisenberg groups and na...