Related papers: On the compounding of higher order monotonic pseud…
With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…
We introduce an expressive subclass of non-negative almost submodular set functions, called strongly 2-coverage functions which include coverage and (sums of) matroid rank functions, and prove that the homogenization of the generating…
It is known that several discrete integrals, including the Choquet and Sugeno integrals as well as some of their generalizations, are comonotonically modular functions. Based on a recent description of the class of comonotonically modular…
We consider the problem of minimising functions represented as a difference of lattice submodular functions. We propose analogues to the SupSub, SubSup and ModMod routines for lattice submodular functions. We show that our…
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
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…
We consider a general collection of function classes on the interval $[0,1]$ defined in terms of certain averages and show that monotone rearrangement does not increase the class constant in each case. The formulation includes BMO and $A_2$…
The concept of monogenic functions over real alternative $\ast$-algebras has recently been introduced to unify several classical monogenic (or regular) functions theories in hypercomplex analysis, including quaternionic, octonionic, and…
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…
In this paper we consider generalized moment functions of higher order. These functions are closely related to the well-known functions of binomial type which have been investigated on various abstract structures. In our former paper we…
Given a function on diagonal matrices, there is a unique way to extend this to an invariant (by conjugation) function on symmetric matrices. We show that the extension preserves regularity -- that is, if the original function is k times…
Recently, it has been shown that many functions on sets can be represented by sum decompositions. These decompositons easily lend themselves to neural approximations, extending the applicability of neural nets to set-valued inputs---Deep…
To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate…
We give a general method for constructing examples of transcendental entire functions of given small order, which allows precise control over the size and shape of the set where the minimum modulus of the function is relatively large. Our…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
We prove that every bounded finely plurisubharmonic function can be locally (in the pluri-fine topology) written as the difference of two usual plurisubharmonic functions. As a consequence finely plurisubharmonic functions are continuous…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
The theory of symmetric functions has been extended to the case where each variable is paired with an anticommuting one. The resulting expressions, dubbed superpolynomials, provide the natural N=1 supersymmetric version of the classical…
We establish that a mode-coupling approximation for the dynamics of multi-component systems obeying Smoluchowski dynamics preserves a subtle yet fundamental property: the matrices of partial density correlation functions are completely…