Related papers: Ore Polynomials in Sage
We continue, in this second article, the study of the the algebraic tools which play a role in tropical algebra. We especially examine here the polynomial algebras over idempotent semi-fields. this work is motivated by the development of…
We present an algorithm for enumerating all odd semisimple two-dimensional mod p Galois representations unramified outside p. We also discuss the implementation of this algorithm in Sage and give a summary of the results we obtained.
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
We associate to a semisimple complex Lie algebra $\mathfrak{g}$ a sequence of polynomials $P_{\ell,\mathfrak{g}}(x)\in\mathbb{Q}[x]$ in $r$ variables, where $r$ is the rank of $\mathfrak{g}$ and $\ell=0,1,2,\ldots $. The polynomials…
The analogous quaternionic polynomials of a class of bivariate orthogonal polynomials (arXiv: 1502.07256, 2014) introduced. The ladder operators for these quaternionic polynomials also studied. For the quaternionic case, the ladder…
We establish new operational formulae of Burchnall type for the complex disk polynomials (generalized Zernike polynomials). We then use them to derive some interesting identities involving these polynomials. In particular, we establish…
This papers studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs). It presents a new framework using discrete ODEs as a central tool for computation and provides several implicit characterizations…
Incorporating neural networks for the solution of Ordinary Differential Equations (ODEs) represents a pivotal research direction within computational mathematics. Within neural network architectures, the integration of the intrinsic…
In this paper we give an effective characterization of Hilbert functions and polynomials of standard algebras over an Artinian equicharacteristic local ring; the cohomological properties of such algebras are also studied. We describe…
We report on a recent implementation of Giesbrecht's algorithm for factoring polynomials in a skew-polynomial ring. We also discuss the equivalence between factoring polynomials in a skew-polynomial ring and decomposing $p^s$-polynomials…
Maximon has recently given an excellent summary of the properties of the Euler dilogarithm function and the frequently used generalizations of the dilogarithm, the most important among them being the polylogarithm function $Li_(z)$. The…
In this paper we first construct an analytic realization of the $C_\lambda$-extended oscillator algebra with the help of difference-differential operators. Secondly, we study families of $d$-orthogonal polynomials which are extensions of…
Many computer algebra systems have more than 1000 built-in functions, making expertise difficult. Using mock dialog boxes, this article describes a proposed interactive general-purpose wizard for organizing optional transformations and…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
We use linear algebraic methods to obtain general results about linear operators on a space of polynomials that we apply to the operators associated with a polynomial sequence by the monomiality property. We show that all such operators are…
We extend recent results in order to construct projective resolutions for modules over twisted tensor products of truncated polynomial rings. We begin by taking note of the conditions necessary to think of these algebras as a type of Ore…
A sequence is difference algebraic (or D-algebraic) if finitely many shifts of its general term satisfy a polynomial relationship; that is, they are the coordinates of a generic point on an affine hypersurface. The corresponding equations…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
Orthogonal polynomials and the Fourier orthogonal series on a cone of revolution in $\mathbb{R}^{d+1}$ are studied. It is shown that orthogonal polynomials with respect to the weight function $(1-t)^\gamma (t^2-\|x\|^2)^{\mu-\frac12}$ on…
In this work we consider a given root of a family of n-degree polynomials as a one-variable function that depends only on the independent term. Then we prove that this function satisfies several ordinary differential equations (ODE). More…