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 5 of 5 for “"Stirling numbers"”.

  1. Topics In Probabilistic Combinatorics

    … known central and local limit theorems for the Stirling numbers of the first and second kind and additionally new limit theorems for the Lah numbers and certain classes of known generalized Stirling numbers. Chapter 5 introduces the Kneser Graph. The exact expected value and variance of the …

    siu-theses Repository record for Topics In Probabilistic Combinatorics (opens in a new tab)

  2. Enumeration Results On Leaf Labeled Trees

    … 410--414] on the asymptotic normality of the Stirling numbers of the second kind translates into asymptotic normality of rooted semilabeled trees with given number of vertices, when the number of internal vertices varies. The Erdos-Szekely bijection specializes to a bijection between …

    south-carolina Repository record for Enumeration Results On Leaf Labeled Trees (opens in a new tab)

  3. A computer algebra package for polynomial sequence recognition

    … 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 …

    uiuc Repository record for A computer algebra package for polynomial sequence recognition (opens in a new tab)

  4. Two Studies of Constraints in High Dimensions: Entropy Inequalities and the Randomized Symmetric Binary Perceptron

    … an infinite series, and a sum over generalized Stirling numbers. This allows us to reduce the proof of the entropy inequality for real k to showing that an associated polynomial has only two real roots in the interval (0,1). This reduction allows us to easily verify the inequality for fixed k …

    mit Repository record for Two Studies of Constraints in High Dimensions: Entropy Inequalities and the Randomized Symmetric Binary Perceptron (opens in a new tab)

  5. Bounding the Number of Graphs Containing Very Long Induced Paths

    Induced graphs are used to describe the structure of a graph, one such type of induced graph that has been studied are long paths. <p>In this thesis we show a way to represent such graphs in terms of an array with two colors and a labeled graph. Using this representation and the techniques of Polya …

    byu Repository record for Bounding the Number of Graphs Containing Very Long Induced Paths (opens in a new tab)