2 Matching Results

Search Results

Advanced search parameters have been applied.

in creator/contributor: "Sutherland, David C. David Craig"

open access

Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux

In this thesis, we describe Schensted's algorithm for finding the length of a longest increasing subsequence of a finite sequence. Schensted's algorithm also constructs a bijection between permutations of the first N natural numbers and standard bitableaux of size N. We also describe the Hillman-Grassl algorithm which constructs a bijection between reverse plane partitions and the solutions in natural numbers of a linear equation involving hook lengths. Pascal programs and sample output for bot… more

Date: August 1983

Creator: Sutherland, David C. (David Craig)

Item Type: Thesis or Dissertation

Partner: UNT Libraries

open access

Automorphism Groups of Strong Bruhat Orders of Coxeter Groups

In this dissertation, we describe the automorphism groups for the strong Bruhat orders A_n-1, B_n, and D_n. In particular, the automorphism group of A_n-1 for n ≥ 3 is isomorphic to the dihedral group of order eight, D_4; the automorphism group of B_n for n ≥ 3 is isomorphic to C_2 x C_2 where C_2 is the cyclic group of order two; the automorphism group of D_n for n > 5 and n even is isomorphic to C_2 x C_2 x C_2; and the automorphism group of D_n for n ≥ 5 and n odd is isomorphic to the dihedr… more

Date: August 1986