Related papers: On the Supremum of Singleton Ratios in Submodular …

We prove weak and strong maximum principles, including a Hopf lemma, for smooth subsolutions to equations defined by linear, second-order, partial differential operators whose principal symbols vanish along a portion of the domain boundary.…

Let f be a germ of an analytic function at infinity that can be analytically continued along any path in the complex plane deprived of a finite set of points, f \in\mathcal{A}(\bar{\C} \setminus A), \sharp A <\infty. J. Nuttall has put…

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

We analyze the topological structure of the Nehari set for a class of functionals depending on a real parameter $\lambda$, and having two degrees of homogeneity. A special attention is paid to the extremal parameter $\lambda^*$, which is…

We study the problem of differentially private constrained maximization of decomposable submodular functions. A submodular function is decomposable if it takes the form of a sum of submodular functions. The special case of maximizing a…

We consider the problem of multi-objective maximization of monotone submodular functions subject to cardinality constraint, often formulated as $\max_{|A|=k}\min_{i\in\{1,\dots,m\}}f_i(A)$. While it is widely known that greedy methods work…

If mu is a smooth density on a hypersurface in R^d whose curvature never vanishes to infinite order, and A is a d-by-d matrix whose eigenvalues all have absolute value greater than 1, then the maximal function given by convolving f with…

For a finite dimensional representation $V$ of a group $G$ over a field $F$, the degree of reductivity $\delta(G,V)$ is the smallest degree $d$ such that every nonzero fixed point $v\in V^{G}\setminus\{0\}$ can be separated from zero by a…

We introduce a similarity relation between submodules of a module $M$ over a ring $R$, extending the classical notion of similarity for right ideals. Focusing on (faithfully) projective modules, we establish a sharp lower bound for the…

Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks. In this paper we…

We prove that, over any field, the dimension of the indeterminacy locus of a rational transformation $f$ of $P^n$ which is defined by monomials of the same degree $d$ with no common factors is at least $(n-2)/2$, provided that the degree of…

Let $G$ be a finite group. If $M_n < M_{n-1} < \ldots < M_1 < M_{0}=G $ where $M_i$ is a maximal subgroup of $M_{i-1}$ for all $i=1, \ldots ,n$, then $M_n $ ($n > 0$) is an \emph{$n$-maximal subgroup} of $G$. A subgroup $M$ of $G$ is called…

The submodular Santa Claus problem was introduced in a seminal work by Goemans, Harvey, Iwata, and Mirrokni (SODA'09) as an application of their structural result. In the mentioned problem $n$ unsplittable resources have to be assigned to…

It is known that a subharmonic function of finite order $\rho$ can be approximated by the logarithm of the modulus of an entire function at the point $z$ outside an exceptional set up to $C\log|z|$. In this article we prove that if such an…

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…

The optimal function $f$ satisfying $$ \mathbb{E} |\sum_{1}^n X_i | \ge f(\mathrbb{E}|X_1|,...,\mathbb{E}|X_n|) $$ for every martingale $(X_1,X_1+X_2, ...,\sum_{i=1}^n X_i)$ is shown to be given by $$ f(a) = \max \Big\{a_k-\sum_{i=1}^{k-1}…

We consider the problem of maximizing a monotone nondecreasing set function under multiple constraints, where the constraints are also characterized by monotone nondecreasing set functions. We propose two greedy algorithms to solve the…

The norm of the gradient $\nabla$f (x) measures the maximum descent of a real-valued smooth function f at x. For (nonsmooth) convex functions, this is expressed by the distance dist(0, $\partial$f (x)) of the subdifferential to the origin,…

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

We present a new type of monotone submodular functions: \emph{multi-peak submodular functions}. Roughly speaking, given a family of sets $\cF$, we construct a monotone submodular function $f$ with a high value $f(S)$ for every set $S \in…