{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/49378"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/49378","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A computer algebra package for polynomial sequence recognition","abstract":"The software package developed in the thesis research implements functions for the intelligent guessing of polynomial sequence formulas based on user-defined expected sequence factors of the input coefficients. We present a specialized hybrid approach to finding exact representations for polynomial sequences that is motivated by the need for an automated procedures to discover the precise forms of these sums based on user guidance, or intuition, as to special sequence factors present in the formulas. In particular, the package combines the user input on the expected special sequence factors in the polynomial coefficient formulas with calls to the existing functions as subroutines that then process formulas for the remaining sequence terms already recognized by these packages. The factorization--based approach to polynomial sequence recognition is unique to this package and allows the search functions to find expressions for polynomial sums involving Stirling numbers and other special triangular sequences that are not readily handled by other software packages. The thesis contains a number of concrete, working examples of the package that are intended to both demonstrate usage and to document its current sequence recognition capabilities.","abstract_html":"The software package developed in the thesis research implements functions for the intelligent guessing of polynomial sequence formulas based on user-defined expected sequence factors of the input coefficients. We present a specialized hybrid approach to finding exact representations for polynomial sequences that is motivated by the need for an automated procedures to discover the precise forms of these sums based on user guidance, or intuition, as to special sequence factors present in the formulas. In particular, the package combines the user input on the expected special sequence factors in the polynomial coefficient formulas with calls to the existing functions as subroutines that then process formulas for the remaining sequence terms already recognized by these packages. The factorization--based approach to polynomial sequence recognition is unique to this package and allows the search functions to find expressions for polynomial sums involving Stirling numbers and other special triangular sequences that are not readily handled by other software packages. The thesis contains a number of concrete, working examples of the package that are intended to both demonstrate usage and to document its current sequence recognition capabilities.","abstract_has_math":false,"creators":["Schmidt, Maxie"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Campbell, Roy H."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-05-30T16:40:58Z","date_published":"2014-05-30T16:40:58Z","updated_at":"2026-07-22T22:25:38Z","subjects":["sequence recognition","polynomial sequence recognition","Stirling numbers"],"languages":["en"],"rights":["Copyright 2014 Maxie Schmidt"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/49378","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Campbell, Roy H."]},{"key":"dc:creator","label":"Author","values":["Schmidt, Maxie"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-05-30T16:40:58Z","2014-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["sequence recognition","polynomial sequence recognition","Stirling numbers"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2014 Maxie Schmidt"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/49378"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The software package developed in the thesis research implements functions for the intelligent guessing of polynomial sequence formulas based on user-defined expected sequence factors of the input coefficients. We present a specialized hybrid approach to finding exact representations for polynomial sequences that is motivated by the need for an automated procedures to discover the precise forms of these sums based on user guidance, or intuition, as to special sequence factors present in the formulas. In particular, the package combines the user input on the expected special sequence factors in the polynomial coefficient formulas with calls to the existing functions as subroutines that then process formulas for the remaining sequence terms already recognized by these packages. The factorization--based approach to polynomial sequence recognition is unique to this package and allows the search functions to find expressions for polynomial sums involving Stirling numbers and other special triangular sequences that are not readily handled by other software packages. The thesis contains a number of concrete, working examples of the package that are intended to both demonstrate usage and to document its current sequence recognition capabilities.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-04-29T20:41:45Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 4 Schmidt_Maxie.tex: 91825 bytes, checksum: 852cc9a0af65c99ffc5e267f0897f268 (MD5) Schmidt_Maxie.pdf: 3922434 bytes, checksum: 269c094200aa120337534c9bc79e28ef (MD5) GuessSequenceData.m: 24675 bytes, checksum: 935546c79321c1333fdf6cc45208ab9b (MD5) GuessPolySequenceFormulas.m: 56066 bytes, checksum: be1097b9af4ecd3601990e4e1c1cae64 (MD5)","Made available in DSpace on 2014-05-30T16:40:58Z (GMT). No. of bitstreams: 5 Maxie_Schmidt.pdf: 3922434 bytes, checksum: 269c094200aa120337534c9bc79e28ef (MD5) GuessSequenceData.m: 24675 bytes, checksum: 935546c79321c1333fdf6cc45208ab9b (MD5) GuessPolySequenceFormulas.m: 56066 bytes, checksum: be1097b9af4ecd3601990e4e1c1cae64 (MD5) Schmidt_Maxie.tex: 91825 bytes, checksum: 852cc9a0af65c99ffc5e267f0897f268 (MD5) license.txt: 4063 bytes, checksum: 2b44d0697763825819e3810cc9de55bb (MD5)"]},{"key":"dc:title","label":"Title","values":["A computer algebra package for polynomial sequence recognition"]}]}],"canonical_facts":{"dc:contributor":["Campbell, Roy H."],"dc:creator":["Schmidt, Maxie"],"dc:date":["2014-05-30T16:40:58Z","2014-05"],"dc:description":["The software package developed in the thesis research implements functions for the intelligent guessing of polynomial sequence formulas based on user-defined expected sequence factors of the input coefficients. We present a specialized hybrid approach to finding exact representations for polynomial sequences that is motivated by the need for an automated procedures to discover the precise forms of these sums based on user guidance, or intuition, as to special sequence factors present in the formulas. In particular, the package combines the user input on the expected special sequence factors in the polynomial coefficient formulas with calls to the existing functions as subroutines that then process formulas for the remaining sequence terms already recognized by these packages. The factorization--based approach to polynomial sequence recognition is unique to this package and allows the search functions to find expressions for polynomial sums involving Stirling numbers and other special triangular sequences that are not readily handled by other software packages. The thesis contains a number of concrete, working examples of the package that are intended to both demonstrate usage and to document its current sequence recognition capabilities.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-04-29T20:41:45Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 4 Schmidt_Maxie.tex: 91825 bytes, checksum: 852cc9a0af65c99ffc5e267f0897f268 (MD5) Schmidt_Maxie.pdf: 3922434 bytes, checksum: 269c094200aa120337534c9bc79e28ef (MD5) GuessSequenceData.m: 24675 bytes, checksum: 935546c79321c1333fdf6cc45208ab9b (MD5) GuessPolySequenceFormulas.m: 56066 bytes, checksum: be1097b9af4ecd3601990e4e1c1cae64 (MD5)","Made available in DSpace on 2014-05-30T16:40:58Z (GMT). No. of bitstreams: 5 Maxie_Schmidt.pdf: 3922434 bytes, checksum: 269c094200aa120337534c9bc79e28ef (MD5) GuessSequenceData.m: 24675 bytes, checksum: 935546c79321c1333fdf6cc45208ab9b (MD5) GuessPolySequenceFormulas.m: 56066 bytes, checksum: be1097b9af4ecd3601990e4e1c1cae64 (MD5) Schmidt_Maxie.tex: 91825 bytes, checksum: 852cc9a0af65c99ffc5e267f0897f268 (MD5) license.txt: 4063 bytes, checksum: 2b44d0697763825819e3810cc9de55bb (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/49378"],"dc:language":["en"],"dc:rights":["Copyright 2014 Maxie Schmidt"],"dc:subject":["sequence recognition","polynomial sequence recognition","Stirling numbers"],"dc:title":["A computer algebra package for polynomial sequence recognition"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:38Z"}