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

Maximizing a monotone submodular function is a fundamental task in machine learning. In this paper, we study the deletion robust version of the problem under the classic matroids constraint. Here the goal is to extract a small size summary…

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

Submodular function maximization has been studied extensively in recent years under various constraints and models. The problem plays a major role in various disciplines. We study a natural online variant of this problem in which elements…

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. We exhibit slices of the representation theory of $\Lambda$ that are always classifiable in stringent geometric terms. Namely, we prove that, for any…

Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum…

In contrast to the many continuous global optimization methods that assume the objective function and constraints are factorable, we study how to find globally maximal solutions to problems that are not factorable, focusing on a particular…

Let $f, g, h\in \mathbb{C}\left[x\right]$ be non-constant complex polynomials satisfying $f(x)=g(h(x))$ and let $f$ be lacunary in the sense that it has at most $l$ non-constant terms. Zannier proved that there exists a function $B_1(l)$ on…

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

We show that the maximal determinant D(n) for $n \times n$ ${\pm 1}$-matrices satisfies $R(n) := D(n)/n^{n/2} \ge \kappa_d > 0$. Here $n^{n/2}$ is the Hadamard upper bound, and $\kappa_d$ depends only on $d := n-h$, where $h$ is the maximal…

In this paper, we study the classic submodular maximization problem subject to a group equality constraint under both non-adaptive and adaptive settings. It has been shown that the utility function of many machine learning applications,…

We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…

Consider the discrete maximal function acting on $\ell^2(\mathbb Z)$ functions \[ \mathcal{C}_{\Lambda} f( n ) := \sup_{ \lambda \in \Lambda} \left| \sum_{m \neq 0} f(n-m) \frac{e^{2 \pi i\lambda m^2}} {m} \right| \] where $\Lambda \subset…

For any increasing function $f: {\Bbb N} \rightarrow {\Bbb N}_{\ge 2}$ which takes only finitely many distinct values, a connected finite dimensional algebra $\Lambda$ is constructed, with the property that $\text{fin.dim}_n\, \Lambda =…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

We introduce a class $\Lambda_{s}$ of functions with complicated local structure. Any function from the class belongs to one of three specifically defined types $f^s _k$, $f_+$, and $f^{-1} _+$ or is a specifically defined composition of…

Let $f$ be function that is analytic in the unit disk ${\mathbb D}=\{z:|z|<1\}$, normalized such that $f(0)=f'(0)-1=0$, i.e., of type $f(z)=z+\sum_{n=2}^{\infty} a_n z^n$. If additionally, \[ \left| \left(\frac{z}{f(z)}\right)^2 f'(z)…

Submodular maximization under various constraints is a fundamental problem studied continuously, in both computer science and operations research, since the late $1970$'s. A central technique in this field is to approximately optimize the…

The scalability of submodular optimization methods is critical for their usability in practice. In this paper, we study the reducibility of submodular functions, a property that enables us to reduce the solution space of submodular…