✍ Scribed by István Nemes; Marko Petkovšek
No coin nor oath required. For personal study only.
The set of sequences that satisfy some linear recurrence relation with constant coefficients is considered. Operations over this set are implemented in the computer algebra system Mathematica. For representing sequences several finite representations are provided together with functions which convert among them. For a large class of identities involving these sequences computer generated proofs can be obtained by the package.
📜 SIMILAR VOLUMES
We present the SP package devoted to the manipulation of Schubert polynomials. These polynomials contain as a subfamily the Schur symmetric functions and allow to extend to non symmetric polynomials the classical combinatorial techniques of the theory of symmetric functions. They have many applicati
The author briefly describes shell theory and equations and then surveys the types of shell problem that are important to the structural designer. He outlines the main approaches to the shell problem and then deals with the important effect of the computer on shell analysis. The paper covers stress