Partially ordered sets and permutations are combinatorial structures having vast applications in theoretical computer science. In this thesis, we study various computational and algorithmic problems related to these structures. The first chapter of...
An interval order is an ordered set whose elements are in correspondence with a collection of intervals in a linearly ordered set, with disjoint intervals ordered by their relative position. The order complex of an ordered set is the simplicial...
Partially ordered sets. ; Convex polytopes. ; Representations of groups.
This thesis deals with geometric representations of ordered sets. In a geometric representation, each element of the ordered set is assigned a geometric object, with two elements incomparable in the ordered set if and only if the corresponding...
In this thesis we develop a theory of Fourier analysis and fast Fourier transforms (FFTs) for finite inverse semigroups. Our results generalize results in the theory of Fourier analysis for finite groups. There is a general method for generating...
For a local field K, we study the affine buildings Ξ n and Δ n naturally associated to SL n ( K ) and Sp n ( K ), respectively. Since Sp n ( K ) is a subgroup of SL 2 n ( K ), we investigate properties of a natural embedding of Δ n in Ξ 2 n ....
This thesis centers around a generalization of the classical discrete Fourier transform. We first present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite...
We study the bijective combinatorics of reduced words. These are fundamental objects in the study of Coxeter groups. We restrict our focus to reduced words of permutations and signed permutations. Our results can all be situated within the context...