Related papers: The submodularity of the covolume function in glob…
Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combinatorial optimization, machine learning, and economics. In…
Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
Submodularity is a discrete domain functional property that can be interpreted as mimicking the role of the well-known convexity/concavity properties in the continuous domain. Submodular functions exhibit strong structure that lead to…
Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a useful…
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…
Continuous submodular functions are a category of generally non-convex/non-concave functions with a wide spectrum of applications. The celebrated property of this class of functions - continuous submodularity - enables both exact…
Set-functions appear in many areas of computer science and applied mathematics, such as machine learning, computer vision, operations research or electrical networks. Among these set-functions, submodular functions play an important role,…
The congruence subgroup property is established for the modular representations associated to any modular tensor category. This result is used to prove that the kernel of the representation of the modular group on the conformal blocks of…
A fundamental theorem in discrete convex analysis states that a set function is M$^\natural$-concave if and only if its conjugate function is submodular. This paper gives a new proof to this fact.
We define a modular function which is a generalization of the elliptic modular lambda function. We show this function and the modular invariant function generate the modular function field with respect to the principal congruence subgroup.…
Notions of ordinal submodularity/supermodularity have been introduced and studied in the literature. We consider several classes of ordinally submodular functions defined on finite Boolean lattices and give characterizations of the set of…
This text surveys cohomological properties of pairs $(U,f)$ consisting of a smooth complex quasi-projective variety $U$ together with a regular function on~it. On the one hand, one tries to mimic the case of a germ of holomorphic function…
In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In cases where exact solutions cannot be computed tractably, it…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications. We characterize these functions and demonstrate that they can be maximized efficiently with approximation…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
We study the globalization of partial actions on sets and topological spaces and of partial coactions on algebras by applying the general theory of globalization for geometric partial comodules, as previously developed by the authors. We…
We study and relate categories of modules, comodules and contramodules over a representation of a small category taking values in (co)algebras, in a manner similar to modules over a ringed space. As a result, we obtain a categorical…