Related papers: Finding Submodularity Hidden in Symmetric Differen…

Let $V$ be a simple, rational, $C_2$-cofinite vertex operator algebra and $G$ a finite group acting faithfully on $V$ as automorphisms, which is simply called a rational vertex operator algebra with a $G$-action. It is shown that the…

Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have…

Submodularity is one of the most well-studied properties of problem classes in combinatorial optimization and many applications of machine learning and data mining, with strong implications for guaranteed optimization. In this thesis, we…

We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…

Let $I\subseteq{\mathbb{R_+}}$ be a non empty and non singleton interval where ${\mathbb{R_+}}$ denotes the set of all non negative numbers. A function $\Phi: I\to {\mathbb{R_+}}$ is said to be subadditive if for any $x,y$ and $x+y\in I$,…

In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…

Let \(\mathbb D\) denote the unit disc in \(\mathbb C\). For a domain \(D\subset\mathbb C\) and a point \(p\in D\), let \(M_D(p)\) denote the supremum of \(\|df_0\|\) over all harmonic maps \(f:\mathbb D\to D\) with \(f(0)=p\) whose…

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…

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=\phi$ to be weakly $S$-prime if…

Based on the recent developments in the irregular Riemann-Hilbert correspondence for holonomic D-modules and the Fourier-Sato transforms for enhanced ind-sheaves, we study the Fourier transforms of some irregular holonomic D-modules. For…

The class of gross substitutes (GS) set functions plays a central role in Economics and Computer Science. GS belongs to the hierarchy of {\em complement free} valuations introduced by Lehmann, Lehmann and Nisan, along with other prominent…

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

In this paper, we associate a new topology to a nonzero unital module $M$ over a commutative $R$, which is called Golomb topology of the $R$-module $M$. Let $M\ $be an\ $R$-module and $B_{M}$ be the family of coprime cosets $\{m+N\}$ where…

In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., optimizing a…

$\newcommand{\F}{\mathbb{F}}$We study the Boolean function parameters sensitivity ($s$), block sensitivity ($bs$), and alternation ($alt$) under specially designed affine transforms. For a function $f:\F_2^n\to \{0,1\}$, and $A=Mx+b$ for $M…

Minimizing the difference of two submodular (DS) functions is a problem that naturally occurs in various machine learning problems. Although it is well known that a DS problem can be equivalently formulated as the minimization of the…

A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…

There have been many parallel streams of research studying order isomorphisms of some specific sets $G$ of functions from a set $X$ to $\mathbb{R}\cup\{\pm\infty\}$, such as the sets of convex or Lipschitz functions. We develop in this…

Lemma 1 from the paper [N.E. Gretsky, J.M. Ostroy, W.R. Zame, Subdifferentiability and the duality gap, Positivity 6: 261--274, 2002] asserts that the value function $v$ of an infinite dimensional linear programming problem in standard form…

Semidefinite programs (SDPs) -- some of the most useful and versatile optimization problems of the last few decades -- are often pathological: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs…