Related papers: Ore Polynomials in Sage
For a non-commutative domain $R$ and a multiplicatively closed set $S$ the (left) Ore localization of $R$ at $S$ exists if and only if $S$ satisfies the (left) Ore property. Since the concept has been introduced by Ore back in the 1930's,…
For any orthogonal polynomials system on real line we construct an appropriate oscillator algebra such that the polynomials make up the eigenfunctions system of the oscillator hamiltonian. The general scheme is divided into two types: a…
Orthogonal polynomials are of fundamental importance in many fields of mathematics and science, therefore the study of a particular family is always relevant. In this manuscript, we present a survey of some general results of the Hermite…
This paper describes generalized polylogarithms, multiple polylogarithms, and multiple zeta values, along with their implementation in Maple 2018. This set of related functions is of interest in high energy physics as well as in number…
In this paper, we study some properties of Euler polynomials arising from umbral calculus. Finally, we give some interesting identities of Euler polynomials using our results. Recently, Dere and Simsek have studied umbral calculus related…
The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.
Arora & Ge introduced a noise-free polynomial system to compute the secret of a Learning With Errors (LWE) instance via linearization. Albrecht et al. later utilized the Arora-Ge polynomial model to study the complexity of Gr\"obner basis…
We investigate the zonal polynomials, a family of symmetric polynomials that appear in many mathematical contexts, such as multivariate statistics, differential geometry, representation theory, and combinatorics. We present two computer…
Integrals involving derivatives of Legendre polynomials frequently arise in applications ranging from multipole expansions for processes involving electromagnetic probes to spectral methods in numerical physics. Despite their practical…
We obtain a series transformation formula involving the classical Hermite polynomials. We then provide a number of applications using appropriate binomial transformations. Several of the new series involve Hermite polynomials and harmonic…
A double Ore extension is a natural generalization of the Ore extension. We prove that a connected graded double Ore extension of an Artin-Schelter regular algebra is Artin-Schelter regular. Some other basic properties such as the…
We propose a sufficient condition of the convergence of a generalized power series formally satisfying an algebraic (polynomial) ordinary differential equation. The proof is based on the majorant method.
In this article we consider the Ore extension Algebra for the algebra $\mathcal{A}$ of functions with finite support on a countable set. We derive explicit formulas for twisted derivations on $\mathcal{A}.$ We give a description for the…
The concept of a universal algorithm is discussed. Examples of this kind of algorithms are presented. Software implementations of such algorithms in C++ type languages are discussed together with means that provide for computations with an…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
The large sieve is used to estimate the density of integral quadratic polynomials $Q$, such that there exists an odd degree integral polynomial which has resultant $\pm 1$ with $Q$. Given a monic integral polynomial $R$ of odd degree, this…
A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1st. order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1st. order ODE-solver and routines for, among other things: the…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
We consider resultant-based methods for elimination of indeterminates of Ore polynomial systems in Ore algebra. We start with defining the concept of resultant for bivariate Ore polynomials then compute it by the Dieudonne determinant of…