# Any Finite Distributive Lattice is Isomorphic to the Minimizer Set of an M^-Concave Set Function

Submodularity is an important concept in combinatorial optimization, and it is often regarded as a discrete analog of convexity. It is a fundamental fact that the set of minimizers of any submodular function forms a distributive lattice. Conversely, it is also known that any finite distributive lattice is isomorphic to the minimizer set of a submodular function, through the celebrated Birkhoff's representation theorem. M^-concavity is a key concept in discrete convex analysis. It is known for set functions that the class of M^-concave is a proper subclass of submodular. Thus, the minimizer set of an M^-concave function forms a distributive lattice. It is natural to ask if any finite distributive lattice appears as the minimizer set of an M^-concave function. This paper affirmatively answers the question.

• 1 publication
• 5 publications
research
05/31/2019

### Majorisation-minimisation algorithms for minimising the difference between lattice submodular functions

We consider the problem of minimising functions represented as a differe...
research
06/09/2021

### Submodular + Concave

It has been well established that first order optimization methods can c...
research
12/23/2017

### Finding the Submodularity Hidden in Symmetric Difference

A fundamental property of convex functions in continuous space is that t...
research
12/23/2017

### Finding Submodularity Hidden in Symmetric Difference

A set function f on a finite set V is submodular if f(X) + f(Y) ≥ f(X ∪...
research
05/17/2018

### Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice

The optimization of submodular functions on the integer lattice has rece...
research
08/19/2021

### Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity

Classes of set functions along with a choice of ground set are a bedrock...
research
06/26/2019

### Re-ranking Based Diversification: A Unifying View

We analyze different re-ranking algorithms for diversification and show ...