Related papers: Double Lowering Operators on Polynomial
Constrained orthogonal polynomials have been recently introduced in the study of the Hohenberg-Kohn functional to provide basis functions satisfying particle number conservation for an expansion of the particle density. More generally, we…
Let $V$ be a vector space over a finite field $k=\mathbb{F} _q$ of dimension $n$. For a polynomial $P:V\to k$ we define the bias of $P$ to be $$b_1(P)=\frac {|\sum _{v\in V}\psi (P(V))|}{q^n}$$ where $\psi :k\to \mathbb{C} ^\star$ is a…
This paper studies the following weighted, fractional Bernstein inequality for spherical polynomials on $\sph$: \begin{equation}\label{4-1-TD-ab} \|(-\Delta_0)^{r/2} f\|_{p,w}\leq C_w n^{r} \|f\|_{p,w}, \ \ \forall f\in \Pi_n^d,…
For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…
Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of…
We prove a general black box result which produces algebras of pseudodifferential operators (ps.d.o.s) on noncompact manifolds, together with a precise principal symbol calculus. Our construction (which also applies in parameter-dependent…
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…
We apply the bi-moment determinant method to compute a representation of the matrix product algebra -- a quadratic algebra satisfied by the operators $\mathbf{d}$ and $\mathbf{e}$ -- for the five parameter ($\alpha$, $\beta$, $\gamma$,…
We study first the supersymmetric quantum mechanics (SUSY QM), specially the cases of the harmonic and radial oscillators. Then, we obtain a new Wronskian formula for the confluent SUSY transformation and apply the SUSY QM to the inverted…
We develop general expressions for the raising and lowering operators that belong to the orthogonal polynomials of hypergeometric type with discrete and continuous variable. We construct the creation and annihilation operators that…
The notion of singular reduction operators, i.e., of singular operators of nonclassical (conditional) symmetry, of partial differential equations in two independent variables is introduced. All possible reductions of these equations to…
This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…
To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…
A widely used method for solving SOS (Sum Of Squares) decomposition problem is to reduce it to the problem of semi-definite programs (SDPs) which can be efficiently solved in theory. In practice, although many SDP solvers can work out some…
A generalization of Arnold's strange duality to invertible polynomials in three variables by the first author and A.Takahashi includes the following relation. For some invertible polynomials $f$ the Saito dual of the reduced monodromy zeta…
Efficiency of intrinsic operator techniques (using only products and ranks of tensor operators) is first evidenced by condensed proofs of already known $\bigtriangledown$-triangle sum rules of su(2)/su$_q$(2). {\em A new compact}…
Quaternionic analysis offers a function theory focused on the concept of $\psi-$hyperholomorphic functions defined as null solutions of the $\psi-$Fueter operator, where $\psi$ is an arbitrary orthogonal base (called structural set) of…
A linear operator on a finite dimensional nonzero real vector space may not have an eigenvalue. We define a related notion of a true-pair of a linear operator, and then show that each linear operator on a finite dimensional nonzero real…
Subresultant of two univariate polynomials is a fundamental object in computational algebra and geometry with many applications (for instance, parametric GCD and parametric multiplicity of roots). In this paper, we generalize the theory of…
The two-matrix model can be solved by introducing bi-orthogonal polynomials. In the case the potentials in the measure are polynomials, finite sequences of bi-orthogonal polynomials (called "windows") satisfy polynomial ODEs as well as…