Related papers: Double Lowering Operators on Polynomial

A problem $\mathcal{P}$ is considered downward self-reducible, if there exists an efficient algorithm for $\mathcal{P}$ that is allowed to make queries to only strictly smaller instances of $\mathcal{P}$. Downward self-reducibility has been…

Let ${\bf u}$ be a nonzero linear functional acting on the space of polynomials. Let $\mathbf{D}_{q,\omega}$ be a Hahn operator acting on the dual space of polynomials. Suppose that there exist polynomials $\phi$ and $\psi$, with…

The T-product for third-order tensors has been used extensively in the literature. In this paper, we first introduce the first-order and second-order T-derivatives for the multi-vector real-valued function with the tensor T-product; and…

We consider the most general Dunkl shift operator $L$ with the following properties: (i) $L$ is of first order in the shift operator and involves reflections; (ii) $L$ preserves the space of polynomials of a given degree; (iii) $L$ is…

Let $P(z)$ be a polynomial of degree $n\geq 1$. In this paper we define an operator $B$, as following, $$B[P(z)]:=\lambda_0 P(z)+\lambda_1 (\frac{nz}{2}) \frac{P'(z)}{1!}+\lambda_2 (\frac{nz}{2})^2 \frac{P''(z)}{2!},$$ where…

This paper presents an innovative approach to the study of recurrent sequences by introducing the concept of arithmetic pseudo-operators. Unlike conventional operators, these pseudo-operators are pure complex numbers with specific…

We consider a general discrete Sobolev inner product involving the Hahn difference operator, so this includes the well--known difference operators $\mathscr{D}_{q}$ and $\Delta$ and, as a limit case, the derivative operator. The objective…

In the present work we characterized full operators and we showed some properties that have nonfull injectives operators. With the results developed for full operators, we affirmatively respond two questions formulated by Bravo and Feintuch…

We construct Baxter operators for the homogeneous closed $\mathrm{XXX}$ spin chain with the quantum space carrying infinite or finite dimensional $s\ell_2$ representations. All algebraic relations of Baxter operators and transfer matrices…

Let T and C be two Hilbert space operators. We prove that if T is near, in a certain sense, to an operator completely polynomially dominated with a finite bound by C, then T is similar to an operator which is completely polynomially…

In this paper, we consider periodic boundary value problems for differential equations whose coefficients are trigonometric polynomials. We construct the spaces of generalized functions, where such problems have solutions. In particular,…

Given a polynomial ring $P$ over a field $K$, an element $g \in P$, and a $K$-subalgebra $S$ of $P$, we deal with the problem of saturating $S$ with respect to $g$, i.e. computing $Sat_g(S) = S[g, g^{-1}]\cap P$. In the general case we…

We analyse the behaviour of the iterates of composition operators defined by polynomials acting on global classes of ultradifferentiable functions of Beurling type which are invariant under the Fourier transform. In particular, we determine…

We give a complete characterization of the positive trigonometric polynomials Q(\theta,\phi) on the bi-circle, which can be factored as Q(\theta,\phi)=|p(e^{i\theta},e^{i\phi})|^2 where p(z,w) is a polynomial nonzero for |z|=1 and |w|\leq…

With every real polynomial $f$, we associate a family $\{f_{\epsilon r}\}_{\epsilon, r}$ of real polynomials, in explicit form in terms of $f$ and the parameters $\epsilon>0,r\in N$, and such that $\Vert f-f_{\epsilon r}\Vert_1\to 0$ as…

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

The purpose of this survey is a comprehensive study of operator Lip\-schitz functions. A continuous function $f$ on the real line ${\Bbb R}$ os called operator Lipschitz if $\|f(A)-f(B)\|\le\operatorname{const}\|A-B\|$ for arbitrary…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…