Items related to A Computer Algebra Package for Polynomial Sequence...
Synopsis
The form of composite sequences involving combinatorial triangles and other integer sequences are common in many mathematical applications. Such composite sequences arise naturally in formulas involving sums of factorial functions and in the symbolic, polynomial expansions of the binomial coefficients and other factorial function variants. The Stirling and Eulerian number triangles also both frequently occur in applications involving finite sums and generating functions over positive powers of integers. In this thesis we provide working proof-of-concept code written in both Mathematica and Sage which can guess new identities for sequences involving special integer sequences based on the first few terms of the sequence. This approach to sequence formula guessing is not new, but our factorization-based approach based on user input and intuition provides a new wrinkle in programs for guessing formulas for sequences.
"synopsis" may belong to another edition of this title.
About the Author
Maxie Schmidt is a researcher interested in number theory, enumerative combinatorics, and experimental mathematics. She has a Master of Science in Computer Science from the University of Illinois at Urbana-Champaign and is currently a Ph.D. student in Mathematics at Georgia Institute of Technology in Atlanta.
"About this title" may belong to another edition of this title.
Search results for A Computer Algebra Package for Polynomial Sequence...
Seller Image
A Computer Algebra Package for Polynomial Sequence Recognition
Published by
LAP LAMBERT Academic Publishing Mai 2017, 2017
ISBN 10: 3659777293
ISBN 13: 9783659777295
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The form of composite sequences involving combinatorial triangles and other integer sequences are common in many mathematical applications. Such composite sequences arise naturally in formulas involving sums of factorial functions and in the symbolic, polynomial expansions of the binomial coefficients and other factorial function variants. The Stirling and Eulerian number triangles also both frequently occur in applications involving finite sums and generating functions over positive powers of integers. In this thesis we provide working proof-of-concept code written in both Mathematica and Sage which can guess new identities for sequences involving special integer sequences based on the first few terms of the sequence. This approach to sequence formula guessing is not new, but our factorization-based approach based on user input and intuition provides a new wrinkle in programs for guessing formulas for sequences. 56 pp. Englisch. Seller Inventory # 9783659777295
Stock Image
A Computer Algebra Package for Polynomial Sequence Recognition
Published by
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 3659777293
ISBN 13: 9783659777295
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 56 pages. 8.66x5.91x0.13 inches. In Stock. Seller Inventory # 3659777293
Buy New
£ 53.53
£ 10 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
A Computer Algebra Package for Polynomial Sequence Recognition
Published by
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 3659777293
ISBN 13: 9783659777295
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The form of composite sequences involving combinatorial triangles and other integer sequences are common in many mathematical applications. Such composite sequences arise naturally in formulas involving sums of factorial functions and in the symbolic, polynomial expansions of the binomial coefficients and other factorial function variants. The Stirling and Eulerian number triangles also both frequently occur in applications involving finite sums and generating functions over positive powers of integers. In this thesis we provide working proof-of-concept code written in both Mathematica and Sage which can guess new identities for sequences involving special integer sequences based on the first few terms of the sequence. This approach to sequence formula guessing is not new, but our factorization-based approach based on user input and intuition provides a new wrinkle in programs for guessing formulas for sequences. Seller Inventory # 9783659777295
Seller Image
A Computer Algebra Package for Polynomial Sequence Recognition
Published by
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 3659777293
ISBN 13: 9783659777295
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Schmidt Maxie D.Maxie Schmidt is a researcher interested in number theory, enumerative combinatorics, and experimental mathematics. She has a Master of Science in Computer Science from the University of Illinois at Urbana-Champaign a. Seller Inventory # 151428664
Buy New
£ 26.85
£ 40.84 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
A Computer Algebra Package for Polynomial Sequence Recognition
Published by
LAP LAMBERT Academic Publishing Mai 2017, 2017
ISBN 10: 3659777293
ISBN 13: 9783659777295
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The form of composite sequences involving combinatorial triangles and other integer sequences are common in many mathematical applications. Such composite sequences arise naturally in formulas involving sums of factorial functions and in the symbolic, polynomial expansions of the binomial coefficients and other factorial function variants. The Stirling and Eulerian number triangles also both frequently occur in applications involving finite sums and generating functions over positive powers of integers. In this thesis we provide working proof-of-concept code written in both Mathematica and Sage which can guess new identities for sequences involving special integer sequences based on the first few terms of the sequence. This approach to sequence formula guessing is not new, but our factorization-based approach based on user input and intuition provides a new wrinkle in programs for guessing formulas for sequences.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 56 pp. Englisch. Seller Inventory # 9783659777295
Seller Image
A Computer Algebra Package for Polynomial Sequence Recognition
Published by
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 3659777293
ISBN 13: 9783659777295
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. A Computer Algebra Package for Polynomial Sequence Recognition | Maxie D. Schmidt | Taschenbuch | 56 S. | Englisch | 2017 | LAP LAMBERT Academic Publishing | EAN 9783659777295 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 109242946