COMPUTER PROOFS OF MATRIX PRODUCT IDENTITIES

DOI10.1142/S0219498804000721MaRDI QIDQ5315542zbMATH OpenOpenAlexFDO

Authors Peter J. Larcombe, Axel Riese, Burkhard Zimmermann

Publication date 8 September 2005

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219498804000721

zbMATH Keywords

computer algebracomputer proofdefinite integrationindefinite rational matrix productsrecurrence relations

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computer proofs for polynomial identities in arbitrary many variables
• Towards computerized proofs of identities
• Rational Functions Certify Combinatorial Identities
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Short and easy computer proofs of the Rogers-Ramanujan identities and of identities of similar type

Cites work

• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• A fast algorithm for proving terminating hypergeometric identities
• An introduction to pseudo-linear algebra
• Differentiably finite power series
• The method of creative telescoping

Cited in

(2)

• Formally verifying proofs for algebraic identities of matrices
• Computer proofs for polynomial identities in arbitrary many variables

This page was built for publication: COMPUTER PROOFS OF MATRIX PRODUCT IDENTITIES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315542)