Related papers: Amplitude maximization in stable systems, Schur po…

Optimization problems with set submodular objective functions have many real-world applications. In discrete scenarios, where the same item can be selected more than once, the domain is generalized from a 2-element set to a bounded integer…

Consider a square random matrix with independent and identically distributed entries of mean zero and unit variance. We show that as the dimension tends to infinity, the spectral radius is equivalent to the square root of the dimension in…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

We initiate the study of the coefficients of the distinct monomials in the expansion of the multivariate polynomials $x_1(x_1+x_2)\cdots(x_1+x_2+\cdots+x_n), n\in\N$. In particular we obtain several results regarding their maximal…

We prove upper bounds on the number of resonances and eigenvalues of Schr\"odinger operators $-\Delta+V$ with complex-valued potentials, where $d\geq 3$ is odd. The novel feature of our upper bounds is that they are \emph{effective}, in the…

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

We consider a property of positive polynomials on a compact set with a small perturbation. When applied to a Polynomial Optimization Problem (POP), the property implies that the optimal value of the corresponding SemiDefinite Programming…

The problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems. Unfortunately, it is generally not possible to maximize a monotone set function up to an acceptable…

Maximality of a contractive tuple of operators is considered. Characterization of a contractive tuple to be maximal is obtained. Notion of maximality of a submodule of Drury-Arveson module on the $d$-dimensional unit ball $\mathbb{B}_d$ is…

In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting of polynomial rings $\mathbb{F}_q[x]$. In the integer setting, for a given polynomial $F \in \mathbb{Z}[x]$ with constant term zero, (a…

In this paper we study the fundamental problems of maximizing a continuous non-monotone submodular function over the hypercube, both with and without coordinate-wise concavity. This family of optimization problems has several applications…

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of trigonometric polynomials with frequencies from an arbitrary finite set…

Denote by $f_D(n)$ the maximum size of a set family $\mathcal{F}$ on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set $D$. That is, $|A \bigtriangleup B| \in D$ holds for every pair of distinct sets $A, B…

Let $\Omega \subset \mathbb{R}^n$ be a bounded domain satisfying a Hayman-type asymmetry condition, and let $ D $ be an arbitrary bounded domain referred to as "obstacle". We are interested in the behaviour of the first Dirichlet eigenvalue…

Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash},…

Let $A_{p,r}^m(n)$ be the best constant that fulfills the following inequality: for every $m$-homogeneous polynomial $P(z) = \sum_{|\alpha|=m} a_{\alpha} z^{\alpha}$ in $n$ complex variables, $$\big( \sum_{|\alpha|=m} |a_{\alpha}|^{r}…

In this article, we have analyzed the full discretization of the Stochastic semilinear Schr\"{o}dinger equation in a bounded convex polygonal domain driven by multiplicative Wiener noise. We use the finite element method for spatial…

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

We use an estimate for character sums over finite fields of Katz to solve open problems of Montgomery and Turan. Let h=>2 be an integer. We prove that inf_{|z_k| => 1} max_{v=1,...,n^h} |sum_{k=1}^n z_k^v| <= (h-1+o(1)) sqrt n. This gives…

We study the Schur polynomial expansion of a family of symmetric polynomials related to the refined enumeration of alternating sign matrices with respect to their inversion number, complementary inversion number and the position of the…