Related papers: A Note on Ordinal Submodularity
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.…
Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…
We demonstrate the usefulness of submodularity in statistics as a characterization of the difficulty of the \emph{search} problem of feature selection. The search problem is the ability of a procedure to identify an informative set of…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
This paper is devoted to the study of metric subregularity and strong subregularity of any positive order $q$ for set-valued mappings in finite and infinite dimensions. While these notions have been studied and applied earlier for $q=1$…
We translate notions and results of decomposition and dimension theories for module categories, into the lattice environment. In particular we translate dimension theory in module categories to complete modular upper-continuous lattices.
Many sequential decision making problems can be formulated as an adaptive submodular maximization problem. However, most of existing studies in this field focus on pool-based setting, where one can pick items in any order, and there have…
This paper investigates the theory of lattices, focusing on extending lattices relative to abstract classes, modular lattices, and torsion lattices. Definitions of type-1 and type-2 extending lattices are provided, along with their weakly…
The aim of this paper is to build a new family of lattices related to some combinatorial extremal sum problems, in particular to a conjecture of Manickam, Mikl\"os and Singhi. We study the fundamentals properties of such lattices and of a…
In this note we study the finite groups whose subgroup lattices are dismantlable.
A fundamental task underlying many important optimization problems, from influence maximization to sensor placement to content recommendation, is to select the optimal group of $k$ items from a larger set. Submodularity has been very…
Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions,…
Suitable duals of multimodules are introduced and used to provide transposition contravariant right semi-adjunctions (and dualitites under reflexivity). Several additional notions on multimodules are discussed: generalized morphisms and…
We introduce residuated ortholattices as a generalization of -- and environment for the investigation of -- orthomodular lattices. We establish a number of basic algebraic facts regarding these structures, characterize orthomodular lattices…
These are notes on the theory of super Riemann surfaces and their moduli spaces, aiming to collect results that are useful for a better understanding of superstring perturbation theory in the RNS formalism.
In this article, we study the relation between lattice basis and successive minima and give an estimate for the measure-theoretical distribution of successive minima. As consequences, we also discuss some logarithm laws associated to higher…
We introduce and study a class of betweenness algebras-Boolean algebras with binary operators, closely related to ternary frames with a betweenness relation. From various axioms for betweenness, we chose those that are most common, which…
In this article, we characterize orders that are level-induced suborders anytime they are induced suborders of a superorder. We also characterize orders that are consecutive level-induced suborders anytime they are level-induced suborders…
Submodular functions have been studied extensively in machine learning and data mining. In particular, the optimization of submodular functions over the integer lattice (integer submodular functions) has recently attracted much interest,…
Let $N$ be a finite set of cardinality $n$, and $a\in N$. A submodular function $f$ on $N$ with $f(a)=1$ is defined to be $a$-reduced if, for any decomposition $f=g+h$ into submodular functions where $h$ does not depend on $a$, it follows…