Related papers: Compatible rewriting of noncommutative polynomials…
We study the effective potential for composite operators. Introducing a source coupled to the composite operator, we define the effective potential by a Legendre transformation. We find that in three or fewer dimensions, one can use the…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We introduce a new approach to the classification of operator identities, based on basic concepts from the theory of algebraic operads together with computational commutative algebra applied to determinantal ideals of matrices over…
We study quantum equivalents of non-commutative operators in quantum mechanics. Any matrix "$B$" satisfying the non-commuting relation $[A,B]\neq 0$ with "$A$", can be used via $B^{-1} AB$ to reproduce eigenvalues of "$A$". This…
A general classification of linear differential and finite-difference operators possessing a finite-dimensional invariant subspace with a polynomial basis is given. The main result is that any operator with the above property must have a…
Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity (AC) properties are proposed. The algorithms are based on a framework for…
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…
Signature-based algorithms have become a standard approach for Gr\"obner basis computations for polynomial systems over fields, but how to extend these techniques to coefficients in general rings is not yet as well understood. In this…
In this paper, we prove new identities for Bernoulli polynomials that extend Alzer and Kwong's results. The key idea is to use the Volkenborn integral over $\mathbb Z_p$ of the Bernoulli polynomials to establish recurrence relations on the…
Let $\mathcal{H}$ be a complex, separable Hilbert space and $\mathcal{B}(\mathcal{H})$ denote the algebra of all bounded linear operators acting on $\mathcal{H}$. Given a unitarily-invariant norm $\| \cdot \|_u$ on…
In this paper we present equivalence results for several types of unbounded operator functions. A generalization of the concept equivalence after extension is introduced and used to prove equivalence and linearization for classes of…
Our goal in this paper is to extend the theory of quasi-exactly solvable Schrodinger operators beyond the Lie-algebraic class. Let $\cP_n$ be the space of n-th degree polynomials in one variable. We first analyze "exceptional polynomial…
In this short paper, the commutator of monomials of operators obeying constant commutation relations is expressed in terms of anticommutators. The formula involves Bernoulli numbers or Euler polynomials evaluated in zero. The role of…
It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…
Unlike the classical polynomial case there has not been invented up to very recently a tool similar to the Bernstein-Bezier representation which would allow us to control the behavior of the exponential polynomials. The exponential analog…
In this paper we introduce a notion of duality for matrix valued orthogonal polynomials with respect to a measure supported on the nonnegative integers. We show that the dual families are closely related to certain difference operators…
We present a computer algebra approach to proving identities on Bernoulli polynomials and Euler polynomials by using the extended Zeilberger's algorithm given by Chen, Hou and Mu. The key idea is to use the contour integral definitions of…
In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in…
Some new characterizations of nonnegative Hamiltonian operator matrices are given. Several necessary and sufficient conditions for an unbounded nonnegative Hamiltonian operators to be invertible are obtained; so that the main results in the…
In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev…