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 2 of 2 for “"Dedekind's Problem"”.

  1. Enumerative combinatorics of posets

    … by an induced property. <br><br> We pose both Dedekind-type questions concerning the number of antichains and a Stanley-type question concerning the number of linear extensions in generalized Boolean lattices; namely, products of chain posets and the poset of partially defined functions. We …

    gatech Repository record for Enumerative combinatorics of posets (opens in a new tab)

  2. On the Number of Ways to Express a Set as a Union of Individually Interesting Sets

    … structure onto datasets, thereby translating problems in statistics to problems in geometry or topology. A common truism in this field is “Data has shape and shape has meaning.” In this thesis, we use combinatorial and categorical arguments to demonstrate some shortcomings of a TDA approach on …

    calpoly Repository record for On the Number of Ways to Express a Set as a Union of Individually Interesting Sets (opens in a new tab)