We show a surprising connexion between a property of the inf convolutions of a family of convex lower semicontinuous functions and the fact that intersections of maximal cyclically monotone graphs are the critical set of a bipotential. We then extend the results from [4] to bipotentials convex covers, generalizing the notion of a bi-implicitly convex lagrangian cover. As an application we prove...

MOTIVATION Given a large-scale biological network represented as an influence graph, in this article we investigate possible decompositions of the network aimed at highlighting specific dynamical properties. RESULTS The first decomposition we study consists in finding a maximal directed acyclic subgraph of the network, which dynamically corresponds to searching for a maximal open-loop subsyst...

This paper has been motivated by general considerations on the topic of Risk Measures, which essentially are convex monotone maps de…ned on spaces of random variables, possibly with the so-called Fatou property. We show …rst that the celebrated Namioka-Klee theorem for linear, positive functionals holds also for convex monotone maps on Frechet lattices. It is well-known among the specialists th...

This paper surveys some recent results on the generation of implicitly given hypergraphs and their applications in Boolean and integer programming, data mining, reliability theory, and combinatorics. Given a monotone property π over the subsets of a finite set V , we consider the problem of incrementally generating the family Fπ of all minimal subsets satisfying property π, when π is given by a...

We continue the study of k-monotone Boolean functions in the property testing model, initiated by Canonne et al. (ITCS 2017). A function f : {0, 1} → {0, 1} is said to be kmonotone if it alternates between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization of (1-)monotone functions, and have been recently studied in circuit complexity, PAC learni...

In this paper, we show the existence of a coupled fixed point theorem of nonlinear contraction mappings in complete metric spaces without the mixed monotone property and give some examples of a nonlinear contraction mapping, which is not applied to the existence of coupled fixed point by using the mixed monotone property. We also study the necessary condition for the uniqueness of a coupled fix...

We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite graph property with bipartitions of size n. This improves the previous best bound of(n4/3) due to Hajnal [Haj91]. Our proof works by improving a graph packing lemma used in earlier work, and this improvement in turn s...

We study tent spaces on general measure spaces (Ω, μ). We assume that there exists a semigroup of positive operators on Lp(Ω, μ) satisfying a monotone property but do not assume any geometric/metric structure on Ω. The semigroup plays the same role as integrals on cones and cubes in Euclidean spaces. We then study BMO spaces on general measure spaces and get an analogue of Fefferman’s H1-BMO du...