Related papers: Finding Submodularity Hidden in Symmetric Differen…

Sign changes in sums of arithmetic functions and their inverses are a subtle topic with room to grow new results. Suppose that $S_f(x) := \sum_{n \leq x} f(n)$ is the summatory function of some arithmetic function $f$ such that $f(1) \neq…

We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order.…

A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper…

Let V(KG) be a normalised unit group of the modular group algebra of a finite p-group G over the field K of p elements. We introduce a notion of symmetric subgroups in V(KG) as subgroups invariant under the action of the classical…

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…

Let $R$ be a commutative ring with a non-zero identity, $S$ be a multiplicatively closed subset of $R$ and $M$ be a unital $R$-module. In this paper, we define a submodule $N$ of $M$ with $(N:_{R}M)\cap S=\emptyset$ to be weakly $S$-primary…

We introduce a novel category of set functions called Extended Deep Submodular functions (EDSFs), which are neural network-representable. EDSFs serve as an extension of Deep Submodular Functions (DSFs), inheriting crucial properties from…

We consider the Arveson-Douglas conjecture on the essential normality of homogeneous submodules corresponding to algebraic subvarieties of the unit ball. We prove that the property of essential normality is preserved by isomorphisms between…

We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a dierence between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at…

We define a notion of pseudo-unitarizability for weight modules over a generalized Weyl algebra (of rank one, with commutative coeffiecient ring $R$), which is assumed to carry an involution of the form $X^*=Y$, $R^*\subseteq R$. We prove…

Building on work of the first and last author, we prove that an embedding of simple affine vertex algebras $V_{\mathbf{k}}(\mathfrak g^0)\subset V_{k}(\mathfrak g)$, corresponding to an embedding of a maximal equal rank reductive subalgebra…

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

This paper extends the Kadison duality between compact convex sets and function systems to the setting of partial convexity. A partially convex set is a set that is convex in a designated set of convex variables when the others are held…

A Lie algebroid on a variety X/k is an extension \alpha: g_X \to T_X of the tangent sheaf both as O_X-module and Lie algebra over the base field, with the obvious compatibilities; and given a Lie algebroid one has its associated ring of…

After defining classical weighted modulation spaces we show some basic properties. In this work we additionally choose an approach in terms of the frequency-uniform decomposition and a discussion on the weights of modulation spaces leads to…

In the context of global optimization of mixed-integer nonlinear optimization formulations, we consider smoothing univariate functions $f$ that satisfy $f(0)=0$, $f$ is increasing and concave on $[0,+\infty)$, $f$ is twice differentiable on…

A number of recent results on optimization problems involving submodular functions have made use of the multilinear relaxation of the problem. These results hold typically in the value oracle model, where the objective function is…

Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…

Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real…

Let $V$ be a vertex algebra of countable dimension, $G$ a subgroup of ${\rm Aut} V$ of finite order, $V^{G}$ the fixed point subalgebra of $V$ under the action of $G$, and ${\mathscr S}$ a finite $G$-stable set of inequivalent irreducible…