Computer proofs for polynomial identities in arbitrary many variables

DOI10.1145/1005285.1005315MaRDI QIDQ4657324zbMATH OpenOpenAlexFDO

Authors M. Kauers

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005285.1005315

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• COMPUTER PROOFS OF MATRIX PRODUCT IDENTITIES
• Towards computerized proofs of identities
• A fast algorithm for proving terminating hypergeometric identities. (Reprint)
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities

Cited in

(8)

• Formally verifying proofs for algebraic identities of matrices
• SumCracker: A package for manipulating symbolic sums and related objects
• Indefinite summation with unspecified summands
• An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
• Checking identities is computationally intractable NP-hard and therefore human provers will always be needed
• scientific article; zbMATH DE number 2151181 (Why is no real title available?)
• COMPUTER PROOFS OF MATRIX PRODUCT IDENTITIES
• Derivations of identities by symbolic computation

Describes a project that uses

Uses Software

• SF
• Mathematica

This page was built for publication: Computer proofs for polynomial identities in arbitrary many variables

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