Related papers: Interpolation by multivariate polynomials in conve…

We discuss relations between uniform minimality, unconditionality and interpolation for families of reproducing kernels in backward shift invariant subspaces. This class of spaces contains as prominent examples the Paley-Wiener spaces for…

The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…

We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this…

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

We consider the problem of complex interpolation of certain Hardy-type subspaces of K\"othe function spaces. For example, suppose $X_0$ and $X_1$ are K\"othe function spaces on the unit circle $\bold T,$ and let $H_{X_0}$ and $H_{X_1}$ be…

A lemma of Micchelli's, concerning radial polynomials and weighted sums of point evaluations, is shown to hold for arbitrary linear functionals, as is Schaback's more recent extension of this lemma and Schaback's result concerning…

We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We…

In [GTZ08, GTZ12], the following result was established: given polynomials $f,g\in\mathbb{C}[x]$ of degrees larger than $1$, if there exist $\alpha,\beta\in\mathbb{C}$ such that their corresponding orbits $\mathcal{O}_f(\alpha)$ and…

In this work we present a newly developed study of the interpolation of weighted Sobolev spaces by the complex method. We show that in some cases, one can obtain an analogue of the famous Stein-Weiss theorem for weighted $L^{p}$ spaces. We…

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

We obtain a characterization of complete interpolating sequences in a class of Fock-type spaces with radial weights for which such sequences exist. Our criterion is formulated in terms of logarithmic separation and controlled perturbations…

We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the…

We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…

By using representation theory, we reduce the size of the set of possible values for the dimension of the convex hull of all feasible points polytope of an orthogonal array (OA) defining integer linear program (ILP). Our results address the…

Let $\Omega \subset \mathbb{C}^n$ be a domain whose Bergman space contains all holomorphic monomials. We derive sufficient conditions for $\Omega$ to be Reinhardt, complete Reinhardt, circular or Hartogs in terms of the orthogonality…

The main goal of the paper is to find an effective estimation for the minimal number of generic points in $\mathbb K^2$ for which the basis for Hermite interpolation consists of the first $\ell$ terms (with respect to total degree…

We study orthogonal polynomials on a fully symmetric planar domain $\Omega$ that is generated by a certain triangle in the first quadrant. For a family of weight functions on $\Omega$, we show that orthogonal polynomials that are even in…

Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

We extend the univariate Newton interpolation algorithm to arbitrary spatial dimensions and for any choice of downward-closed polynomial space, while preserving its quadratic runtime and linear storage cost. The generalisation supports any…