Decomposition of polynomials with respect to the cyclic group of order \(m\)

zbMath0947.65057MaRDI QIDQ1971735

A. Zarzo, IvÁn Area, Eduardo Paciência Godoy, André Ronveaux

Publication date: 7 June 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmorthogonal polynomialsholonomic equationspolynomials decomposition

Mathematics Subject Classification ID

Analytical theory of ordinary differential equations: series, transformations, transforms, operational calculus, etc. (34A25) Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05) Linear ordinary differential equations and systems (34A30) Real polynomials: location of zeros (26C10)

Related Items

Differential equations satisfied by the components with respect to the cyclic group of order \(n\) of some special functions, Some applications of a hypergeometric identity

Uses Software

• gfun
• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic decomposition of orthogonal polynomials: a matrix approach
• Prolégomènes à l'étude des polynômes orthogonaux semi- classiques. (Preliminary remarks for the study of semi-classical orthogonal polynomials)
• On sieved orthogonal polynomials. IV. Generating functions
• Corrigendum: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
• Differentiably finite power series
• Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
• Recurrence relations for connection coefficients between two families of orthogonal polynomials
• GFUN
• Results for some inversion problems for classical continuous and discrete orthogonal polynomials