Related papers: Ore Polynomials in Sage
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…
After a self-contained introduction to Lie algebra cohomology, we present some recent applications in mathematics and in physics. Contents: 1. Preliminaries: L_X, i_X, d 2. Elementary differential geometry on Lie groups 3. Lie algebra…
The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these…
We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…
The content of a polynomial over a ring $R$ is a well understood notion. Ohm and Rush generalized this concept of a content map to an arbitrary ring extension of $R$, although it can behave quite badly. We examine five properties an algebra…
There is a two-component log-gas system with Boltzmann factor which provides an interpolation between the eigenvalue PDF for $\beta = 1$ and $\beta = 4$ invariant random matrix ensembles. The solvability of this log-gas system relies on the…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ...,…
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…
We observe \cite[Proposition 4.1]{LaLe} that Poisson polynomial extensions appear as semiclassical limits of a class of Ore extensions. As an application, a Poisson generalized Weyl algebra $A_1$ considered as a Poisson version of the…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
In the last decade major steps towards an algorithmic treatment of orthogonal polynomials and special functions (OP & SF) have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric…
Let $B$ be a Poisson algebra $\Bbb C[x_1,\ldots, x_k]$ with Poisson bracket such that $$\{x_j,x_i\}=c_{ji}x_ix_j+p_{ji}$$ for all $j>i$, where $c_{ji}\in\Bbb C$ and $p_{ji}\in\Bbb C[x_1,\ldots,x_i]$. Here we obtain an iterated skew…
The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…
We introduce a class of multidimensional Schr\"odinger operators with elliptic potential which generalize the classical Lam\'e operator to higher dimensions. One natural example is the Calogero--Moser operator, others are related to the…
The operational calculus associated with special polynomials has proven to be a powerful tool for analyzing and simplifying their properties. This article examines the bivariate degenerate Hermite polynomials with a focus on their…
We present a systematic study of join-extensions and join-completions of ordered algebras, which naturally leads to a refined and simplified treatment of fundamental results and constructions in the theory of ordered structures ranging from…
We consider a polynomial version of the Cayley numbers. Namely, we define the ring of Cayley polynomials in terms of generators and relations in the category of alternative algebras. The ring turns out to be an octonion algebra over an…
The computational complexity of polynomial ideals and Gr\"obner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…