Related papers: Finding Submodularity Hidden in Symmetric Differen…

We study a unified framework for optimization problems defined on dual-modular instances, where the input comprises a finite ground set $V$ and two set functions: a monotone supermodular reward function $\f$ and a strictly monotone…

The authors have conjectured (\cite{KoM}) that if a normalized generalized modular function (GMF) $f$, defined on a congruence subgroup $\Gamma$, has integral Fourier coefficients, then $f$ is classical in the sense that some power $f^m$ is…

We show that for any constant $\epsilon > 0$ and $p \ge 1$, it is possible to distinguish functions $f : \{0,1\}^n \to [0,1]$ that are submodular from those that are $\epsilon$-far from every submodular function in $\ell_p$ distance with a…

We investigate infinite dimensional modules for an affine group scheme $\mathbb G$ of finite type over a field of positive characteristic $p$. For any subspace $X \subset \mathcal O(\mathbb G)$ of the coordinate algebra of $\mathbb G$, we…

We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…

Given a germ of holomorphic map $f$ from $\mathbb C^n$ to $\mathbb C^{n+1}$, we define a module $M(f)$ whose dimension over $\mathbb C$ is an upper bound for the $\mathscr A$-codimension of $f$, with equality if $f$ is weighted homogeneous.…

Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

Let $(X, \mathscr{L}, \lambda)$ and $(Y, \mathscr{M}, \mu)$ be finite measure spaces for which there exist $A \in \mathscr{L}$ and $B \in \mathscr{M}$ with either $0 < \lambda(A) < 1 < \lambda(X)$ and $0 < \mu(B) < \mu(Y)$, or the other way…

We start with an overview of a class of submodular functions called SCMMs (sums of concave composed with non-negative modular functions plus a final arbitrary modular). We then define a new class of submodular functions we call {\em deep…

Maximizing a non-negative, monontone, submodular function $f$ over $n$ elements under a cardinality constraint $k$ (SMCC) is a well-studied NP-hard problem. It has important applications in, e.g., machine learning and influence…

It is generally believed that submodular functions -- and the more general class of $\gamma$-weakly submodular functions -- may only be optimized under the non-negativity assumption $f(S) \geq 0$. In this paper, we show that once the…

In this paper we develop general formulas for the subdifferential of the pointwise supremum of convex functions, which cover and unify both the compact continuous and the non-compact non-continuous settings. From the non-continuous to the…

Let $D$ be a division ring, $\mathcal V$ and $ \mathcal W$ vector spaces over $D$, and ${\mathcal L(\mathcal V,\mathcal W)}$ the ${\mathcal L(\mathcal W)}$-${\mathcal L(\mathcal V)}$ bimodule of all linear transformations from $\mathcal V$…

Let $\Diffeo=\Diffeo(\R)$ denote the group of infinitely-differentiable diffeomorphisms of the real line $\R$, under the operation of composition, and let $\Diffeo^+$ be the subgroup of diffeomorphisms of degree +1, i.e.…

To a smooth and symmetric function $f$ defined on a symmetric open set $\Gamma\subset\mathbb{R}^{n}$ and a real $n$-dimensional vector space $V$ we assign an associated operator function $F$ defined on an open subset…

Let V be a simple vertex operator algebra and let G be a finite automorphism group of V. In [DY], it was shown that any irreducible V-module is a completely reducible V^G-module where V^G is the G-invariant sub-vertex operator algebra of V.…

In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), i.e., the discrete version of the D.C. programming problem. The developed algorithm is a branch-and-bound-based algorithm…

We show that for any continuous monotonic fixed-point free automorphism $f$ on a $\sigma$-compact subgroup $G\subset \mathbb R$ there exists a binary operation $+_f$ such that $\langle G, +_f\rangle$ is a topological group topologically…

We investigate the possibility that supersymmetry is not a fundamental symmetry of nature, but emerges as an accidental approximate global symmetry at low energies. This can occur if the visible sector is non-supersymmetric at high scales,…