相关论文: On the Supremum of Singleton Ratios in Submodular …

Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…

We give a formula for the number of irreducibles (with multiplicity) in the decomposition of the plethysm $s_\lambda[s_m]$ of Schur functions in terms of the number of lattice points in certain rational polytopes. In the case where $\lambda…

Minimizing a sum of simple submodular functions of limited support is a special case of general submodular function minimization that has seen numerous applications in machine learning. We develop fast techniques for instances where…

Let $D\subset \R^n$, $n\geq 3,$ be a bounded domain with a $C^{\infty}$ boundary $S$, $L=-\nabla^2+q(x)$ be a selfadjoint operator defined in $H=L^2(D)$ by the Neumann boundary condition, $\theta(x,y,\lambda)$ be its spectral function,…

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

Let A and B be finite sets in a commutative group. We bound |A+hB| in terms of |A|, |A+B| and h. We provide a submultiplicative upper bound that improves on the existing bound of Imre Ruzsa by inserting a factor that decreases with h.

Let kappa be an uncountable regular cardinal. Call an equivalence relation on functions from kappa into 2 Sigma_1^1-definable over H(kappa) if there is a first order sentence F and a parameter R subseteq H(kappa) such that functions…

For entire Dirichlet series of the form $F(z)=\sum\limits_{n=0}^{+\infty} a_{n}e^{z\lambda_n},\ 0\le\lambda_n\uparrow+\infty\ (n\to+\infty)$, we establish conditions under which the relation $$…

The problem of maximizing nonnegative monotone submodular functions under a certain constraint has been intensively studied in the last decade, and a wide range of efficient approximation algorithms have been developed for this problem.…

We consider some second order quasilinear partial differential inequalities for real valued functions on the unit ball and find conditions under which there is a lower bound for the supremum of nonnegative solutions that do not vanish at…

Diagonals of rational functions are an important class of functions arising in number theory, algebraic geometry, combinatorics, and physics. In this paper we study the diagonal grade of a function $f$, which is defined to be the smallest…

Let $P(z)=z^{n}+a_{n-2}z^{n-2}+\cdots+a_0$ be a nonconstant polynomial and $S(z)$ be a nonzero rational function and denote $h(z)=S(z)e^{P(z)}$. Let $\theta\in(0,\pi/2n)$ be a constant and $\varepsilon>0$ be a small constant. It is shown…

Given a finite sequence $a:={a_1, ..., a_N}$ in a domain $\Omega \subset C^n$, and complex scalars $v:={v_1, ..., v_N}$, consider the classical extremal problem of finding the smallest uniform norm of a holomorphic function verifying…

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…

The possibilities for limit functions on a Fatou component for the iteration of a single polynomial or rational function are well understood and quite restricted. In non-autonomous iteration, where one considers compositions of arbitrary…

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different…

It has been well established that first order optimization methods can converge to the maximal objective value of concave functions and provide constant factor approximation guarantees for (non-convex/non-concave) continuous submodular…

A set function $f$ on a finite set $V$ is submodular if $f(X) + f(Y) \geq f(X \cup Y) + f(X \cap Y)$ for any pair $X, Y \subseteq V$. The symmetric difference transformation (SD-transformation) of $f$ by a canonical set $S \subseteq V$ is a…