This paper sheds a new light on submodular function minimization and maximization from the viewpoint of discrete convex analysis. L-convex functions and M-concave functions constitute subclasses of submodular functions on an integer interval. Whereas L-convex functions can be minimized efficiently on the basis of submodular (set) function minimization algorithms, M-concave functions are identif...

Let K and L be compact convex sets in Rn. Suppose that, for a given dimension 1 ≤ d ≤ n − 1, every d-dimensional orthogonal projection of L contains a translate of the corresponding projection of K. Does it follow that the original set L contains a translate of K? In other words, if K can be translated to “hide behind” L from any perspective, does it follow that K can “hide inside” L? A compact...

Let K ⊂ R d be a sufficiently round convex body (the ratio of the circumscribed ball to the inscribed ball is bounded by a constant) of a sufficiently large volume. We investigate the randomized integer convex hull I L (K) = conv(K ∩L), where L is a randomly translated and rotated copy of the integer lattice Z d. We estimate the expected number of vertices of I L (K), whose behaviour is similar...

In this paper, we study compact convex Lefschetz fibrations on compact convex symplectic manifolds (i.e., Liouville domains) of dimension 2n + 2 which are introduced by Seidel and later also studied by McLean. By a result of Akbulut-Arikan, the open book on ∂W , which we call convex open book, induced by a compact convex Lefschetz fibration on W carries the contact structure induced by the conv...

is said to be consistent, if an element xEK satisfying all m inequalities (i.e. a solution of (1)) does exist. Otherwise (1) is said to be inconsistent. A system (1) is said to be irreducibly inconsistent, if it is inconsistent and if every proper subsystem of (1) is consistent. The convex functions /i, ft, • • • , fm are said to be linearly independent, if no linear combination JZJlx Ai/,with ...

A class of discrete convex functions that can efficiently be minimized has been considered by Murota. Among them are L\-convex functions, which are natural extensions of submodular set functions. We first consider the problem of minimizing an L\-convex function with a linear inequality constraint having a positive normal vector. We propose a polynomial algorithm to solve it based on a binary se...

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

For n ≥ 2 a construction is given for convex bodies K and L in R n such that the orthogonal projection Ku can be translated inside Lu for every direction u, while the volumes of K and L satisfy Vn(K) > Vn(L). A more general construction is then given for n-dimensional convex bodies K and L such that the orthogonal projection Kξ can be translated inside Lξ for every k-dimensional subspace ξ of R...