Related papers: On some classical problems concerning $L_{\infty}$…
Some 76 years ago P. Tur\'an was the first to establish lower estimations of the ratio of the maximum norm of the derivatives of polynomials and the maximum norm of the polynomials themselves on the interval I:=[-1,1] and on the unit disk…
First we give here a simple proof of a remarkable result of Videnskii and Shirokov: let $B$ be a Blaschke product with $n$ zeros, then there exists an outer function $\phi, \phi(0)=1$, such that $\|(B\phi)'\| \leq C n$, where $C$ is an…
For $w$ in the symmetric group, we provide an exact formula for the smallest positive power $q^{h(w)}$ appearing in the Kazhdan-Lusztig polynomial $P_{e,w}(q)$. We also provide a tight upper bound on $h(w)$ in simply-laced types, resolving…
The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…
Closely following recent ideas of J. Borcea, we discuss various modifications and relaxations of Sendov's conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated…
In this survey, we review the properties of minimal spectral $k$-partitions in the two-dimensional case and revisit their connections with Pleijel's Theorem. We focus on the large $k$ problem (and the hexagonal conjecture) in connection…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
We obtain new effective results in best approximation theory, specifically moduli of uniqueness and constants of strong unicity, for the problem of best uniform approximation with bounded coefficients, as first considered by Roulier and…
For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…
Efficient algorithms for convex optimization, such as the ellipsoid method, require an a priori bound on the radius of a ball around the origin guaranteed to contain an optimal solution if one exists. For linear and convex quadratic…
Liu, Pach and S\'andor recently characterized all polynomials $p(z)$ such that the equation $x+y=p(z)$ is $2$-Ramsey, that is, any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic solutions for $x+y=p(z)$. In this paper,…
With any integer convex polytope $P\subset\midR^n$ we associate a multivariate hypergeometric polynomial whose set of exponents is $\midZ^{n}\cap P.$ This polynomial is defined uniquely up to a constant multiple and satisfies a holonomic…
The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…
We explore the optimality of the constants making valid the recently established Little Grothendieck inequality for JB$^*$-triples and JB$^*$-algebras. In our main result we prove that for each bounded linear operator $T$ from a…
We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…
The approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within error $1/3$ in the $\ell_\infty$ norm. In an influential result, Aaronson and Shi (J. ACM…
The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
We solve the problem of factoring polynomials $V_n(x) \pm 1$ and $W_n(x) \pm 1$ where $V_n(x)$ and $W_n(x)$ are Chebyshev polynomials of the third and fourth kinds. The method of proof is based on previous work by Wolfram [12] for factoring…
We lift upper and lower estimates from linear functionals to $n$-homogeneous polynomials and using this result show that $l_\infty$ is finitely represented in the space of $n$-homogeneous polynomials, $n\ge2$, for any infinite dimensional…