Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Integer Compositions"”.

  1. Integer Compositions, Gray Code, and the Fibonacci Sequence

    … I show the relation of binary and Gray Code to integer compositions and the Fibonacci sequence through the use of analytic combinatorics, Zeckendorf's Theorem, and generating functions.</p>

    gsu Repository record for Integer Compositions, Gray Code, and the Fibonacci Sequence (opens in a new tab)

  2. New Results on Cyclic Compositions and Multicompositions

    Integer compositions, cyclic compositions, and lately k-compositions, are an important topic in combinatorics and number theory. In this paper, we will explain, the general approach of using generating functions to study number sequences involving compositions, cyclic compositions, k-compositions, …

    gsu Repository record for New Results on Cyclic Compositions and Multicompositions (opens in a new tab)

  3. Compositions, Bijections, and Enumerations

    … this thesis we give an introduction to colored-compositions of an integer. This is a generalization of traditional integer compositions, and we show a few results for n-color compositions which are analogous to regular compositions with both combinatorial and analytic proofs. We also show …

    gsu Repository record for Compositions, Bijections, and Enumerations (opens in a new tab)

  4. Combinatorics of Compositions

    Integer compositions and related enumeration problems have been extensively studied. The cyclic analogues of such questions, however, have significantly fewer results. In this thesis, we follow the cyclic construction of Flajolet and Soria to obtain generating functions for cyclic compositions and …

    gsu Repository record for Combinatorics of Compositions (opens in a new tab)

  5. Enumerative properties of restricted words and compositions

    … exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count cyclically restricted and circular objects. This either fills gaps in the current …

    carleton Repository record for Enumerative properties of restricted words and compositions (opens in a new tab)

  6. Quasi-Isometric Graph Simplification and Graph Centrality

    … are called partition-paths and can be viewed as integer compositions with restricted part-sizes. Under three specific settings, we use combinatorial techniques to derive a recurrence to count the total number of balanced partition-paths, and establish regular-language characterisations of the …

    auckland-ms Repository record for Quasi-Isometric Graph Simplification and Graph Centrality (opens in a new tab)

  7. Multivariate Limit Theorems and Algebraic Generating Functions

    … theorem conjectured in work of Chung et al.), integer compositions, and n-colour compositions with varying restrictions and values tracked. Key to establishing these explicit results in an arbitrary dimension is an interesting symbolic determinant, which we compute by conjecturing and then …

    waterloo Repository record for Multivariate Limit Theorems and Algebraic Generating Functions (opens in a new tab)