Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library 1 We show how some c...

The concept of M-convex functions has recently been generalized for functions defined on constant-parity jump systems. The b-matching problem and its generalization provide canonical examples of M-convex functions on jump systems. In this paper, we propose a steepest descent algorithm for minimizing M-convex functions on constant-parity jump systems.

Let M = G/K be a homogeneous Riemannian manifold with dimCGC = dimRG, where GC 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 natur...

The eigenspace structure for a given n × n concave Monge matrix in a max-plus algebra is described. Based on the description, an O(n) algorithm for computing the eigenspace dimension is formulated, which is faster than the previously known algorithms. Analogous results for convex Monge matrices have been published in [M. Gavalec, J. Plavka, Structure of the eigenspace of a Monge matrix in max-p...

In this paper, we reveal a relation between joint winner property (JWP) in the field of valued constraint satisfaction problems (VCSPs) and M-convexity in the field of discrete convex analysis (DCA). We introduce the M-convex completion problem, and show that a function f satisfying the JWP is Z-free if and only if a certain function f associated with f is M-convex completable. This means that ...

This article investigates the notions of exposed points and (exposed) faces in matrix convex setting. Matrix finite dimensions were first defined by Kriel 2019. Here this notion is extended to sets infinite-dimensional vector spaces. Then a connection between extreme established: point ordinary if only it exposed. leads Krein-Milman type result for that due Straszewicz-Klee classical convexity:...

Recently K. Murota has introduced concepts of L-convex function and Mconvex function as generalizations of those of submodular function and base polyhedron, respectively, and has shown separation theorems for L-convex/concave functions and for M-convex/concave functions. The present note gives short alternative proofs of the separation theorems by relating them to the ordinary separation theore...

The concept of M-convexity for functions in integer variables, introduced by Murota (1995), plays a primary role in the theory of discrete convex analysis. In this paper, we consider the problem of minimizing an M-convex function, which is a natural generalization of the separable convex resource allocation problem under a submodular constraint and contains some classes of nonseparable convex f...