The broad goal in this thesis is to enumerate elements and fuzzy subsets of a finite set enjoying some useful properties through the well-known counting technique of the principle of inclusion-exclusion. We consider the set of membership values to be finite and uniformly spaced in the real unit interval. Further we define an equivalence relation with regards to the cardinalities of fuzzy subsets providing the Möbius function and Möbius inversion in that context.

In this dissertation we will look at properties of two different posets from different perspectives. The first poset is the Rees product of the face lattice of the n-cube with the chain. Specifically we study the Möbius function of this poset. Our proof techniques include straightforward enumeration and a bijection between a set of labeled augmented skew diagrams and barred signed permutations which label the maximal chains of this poset. Because the Rees product of this poset is Cohen-Macaulay, we find a basis for the top homology group and a representation of the top homology group over the symmetric group both indexed by the set of labeled augmented skew diagrams. We also show that the Möbius function of the Rees product of a graded poset with the t-ary tree and the Rees product of its dual with the t-ary tree coincide. We discuss labelings for Rees and Segre products in general, particularly the Rees product of the face lattice of a polytope with the chain. We also look at cases where the Möbius function of a poset is equal to the permanent of a matrix and we consider local h-vectors for the barycentric subdivision of the n-cube. In each section we state open conjectures. The second poset in this dissertation is the Dowling lattice. In particular we look at the k = 1 case, that is, the partition lattice. We study inequalities on the flag vector of the partition lattice via a weighted boustrophedon transform and determine a more generalized version for the Dowling lattice. We generalize a determinantal formula of Niven and conclude with conjectures and avenues of study.

For an affine Weyl group W, we explicitly determine the elements for which the Möbius function of the subposet of affine Grassmannians under the Bruhat order is non-zero by utilizing the quantum Bruhat graph of the classical Weyl group associated to W . Then we examine embedding stable and consistent statistics on the affine Weyl group of type A which permit the definition of an affine infinite symmetric group. / Doctor of Philosophy / Similar to the integers, there are groups that have both an infinite number of elements and also a way to partially order those elements. With a partial ordering, we can consider the interval between two elements. When we make a function that sums over an interval of elements, then we can invert the function by using something called the Mӧbius function. For many groups, the Mӧbius function is extremely unpredictable and calculating the inverse may require us to consider an infinite number of elements. In this paper, we focus on groups called affine Weyl groups, which are very useful in algebraic geometry. It turns out that most elements in these groups have a very predictable pattern in their Mӧbius functions which only considers a finite number of elements. The first part of this paper gives very simple rules for calculating it. The second part of this paper focuses on a special type of affine Weyl group: the affine symmetric groups. We provide an attempt at defining a large parent group, which we call the affine infinite symmetric group, that contains all the other affine symmetric groups.