Related papers: Double Lowering Operators on Polynomial
This article is to give an infinite dimensional analogue of a result of Choi and Effros. We say that an (not necessarily unital) operator system $T$ is \emph{dualizable} if one can find an equivalent dual matrix norm on the dual space $T^*$…
We study the second-order differential operators \(\mathcal D_{\Xi}\) and \(\mathcal D_{\Lambda}\) associated with the rescaled polynomial families \((\widetilde{\Xi}_n)\) and \((\widetilde{\Lambda}_n)\), and more generally the polynomial…
It is shown using Schur complement techniques that on finite dimensional Hilbert spaces, a non-negative operator valued trigonometric polynomial in two variables with degree $(d_1,d_2)$ can be written as a finite sum of hermitian squares of…
We prove super-polynomial lower bounds on the size of propositional proof systems operating with constant-depth algebraic circuits over fields of zero characteristic. Specifically, we show that the subset-sum variant…
We continue the study initiated by H. S. Shapiro on Fischer decompositions of entire functions, showing that such decomposition exist in a weak sense (we do not prove uniqueness) under hypotheses regarding the order of the entire function…
In previous work we established a multilinear duality and factorisation theory for norm inequalities for pointwise weighted geometric means of positive linear operators defined on normed lattices. In this paper we extend the reach of the…
We describe the Bockting operator $\psi$ for a tridiagonal pair of $q$-Racah type, in terms of a certain $L$-operator for the quantum loop algebra $U_q(L({\mathfrak {sl}}_2))$.
The floating-point implementation of a function on an interval often reduces to polynomial approximation, the polynomial being typically provided by Remez algorithm. However, the floating-point evaluation of a Remez polynomial sometimes…
We investigate linear operators $A:\mathbb{R}[x_1,\dots,x_n]\to\mathbb{R}[x_1,\dots,x_n]$. We give explicit operators $A$ such that, for fixed $d\in\mathbb{N}_0$ and closed $K\subseteq\mathbb{R}^n$, $e^A\mathrm{Pos}(K)_{\leq…
Two doubly indexed families of polynomials in several indeterminates are considered. They are related to the falling and rising factorials in a similar way as the potential polynomials (introduced by L. Comtet) are related to the ordinary…
Classification theorems for linear differential equations in two real variables, possessing eigenfunctions in the form of the polynomials (the generalized Bochner problem) are given. The main result is based on the consideration of the…
In a previous paper I showed how the ideal SLAC derivative and second-derivative operators for an infinite lattice can be obtained in simple closed form in position space, and implemented very efficiently in a stochastic fashion for…
We compare algorithms for global optimization of polynomial functions in many variables. It is demonstrated that existing algebraic methods (Gr\"obner bases, resultants, homotopy methods) are dramatically outperformed by a relaxation…
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…
We prove sharp inequalities for the symmetric-decreasing rearrangement in Fourier space of functions in $\mathbb{R}^d$. Our main result can be applied to a general class of (pseudo-)differential operators in $\mathbb{R}^d$ of arbitrary…
The problem of minimizing a polynomial over a set of polynomial inequalities is an NP-hard non-convex problem. Thanks to powerful results from real algebraic geometry, one can convert this problem into a nested sequence of…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
Downward collapse (a.k.a. upward separation) refers to cases where the equality of two larger classes implies the equality of two smaller classes. We provide an unqualified downward collapse result completely within the polynomial…
We continue to explore cyclotomic factors in the descent set polynomial $Q_{n}(t)$, which was introduced by Chebikin, Ehrenborg, Pylyavskyy and Readdy. We obtain large classes of factors of the form $\Phi_{2s}$ or $\Phi_{4s}$ where $s$ is…
In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…