• Login
    View Item 
    •   Athenaeum Home
    • University of Georgia Theses and Dissertations
    • University of Georgia Theses and Dissertations
    • View Item
    •   Athenaeum Home
    • University of Georgia Theses and Dissertations
    • University of Georgia Theses and Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    AutoGF : an automated system to calculate coefficients of generating functions

    Thumbnail
    Date
    2002-05
    Author
    Cao, Huantian
    Metadata
    Show full item record
    Abstract
    AutoGF, an automated system to calculate coefficients of generating functions, is developed in this thesis. The algorithms for power series manipulations such as addition, substraction, multiplication, division, powers, exponentiation, logorithm, reversion and composition are implemented in AutoGF. Maclaurin series provide the basis for calculating the coefficients of basic generating functions. User defined gener-ating functions are also provided for. By writing a text file listing the algebraic steps defining a target generating function, the user of AutoGF can obtain the coefficients of very complicated generating functions.|Exponential generating functions are widely used to count labeled graphs and digraphs. By applying a Hadamard product to the coefficients of exponential gen-erating functions, the exact numbers of labeled graphs or digraphs with different numbers of vertices can be obtained under various restrictions using AutoGF. This is demonstrated for connected graphs, blocks, connected eulerian graphs, acyclic digraphs, strong digraphs, and forests. The time performances of these graphical enumerations are investigated and their time complexities are estimated.|Generating functions can also be applied to count integer partitions. The numbers of all partitions and of partitions into distinct parts are calculated by using AutoGF. The time performances of these partition enumerations are investigated and their time complexities are estimated.
    URI
    http://purl.galileo.usg.edu/uga_etd/cao_huantian_200205_ms
    http://hdl.handle.net/10724/20510
    Collections
    • University of Georgia Theses and Dissertations

    About Athenaeum | Contact Us | Send Feedback
     

     

    Browse

    All of AthenaeumCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    About Athenaeum | Contact Us | Send Feedback