Search Results

open access

Automorphism Groups of Strong Bruhat Orders of Coxeter Groups

Description: 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
Creator: Sutherland, David C. (David Craig)
Partner: UNT Libraries
open access

Infinite Planar Graphs

Description: How many equivalence classes of geodesic rays does a graph contain? How many bounded automorphisms does a planar graph have? Neimayer and Watkins studied these two questions and answered them for a certain class of graphs. Using the concept of excess of a vertex, the class of graphs that Neimayer and Watkins studied are extended to include graphs with positive excess at each vertex. The results of this paper show that there are an uncountable number of geodesic fibers for graphs in this exte… more
Date: May 2000
Creator: Aurand, Eric William
Partner: UNT Libraries
open access

Some Properties of Partially Ordered Sets

Description: It may be said of certain pairs of elements of a set that one element precedes the other. If the collection of all such pairs of elements in a given set exhibits certain properties, the set and the collection of pairs is said to constitute a partially ordered set. The purpose of this paper is to explore some of the properties of partially ordered sets.
Date: August 1966
Creator: Hudson, Philip Wayne
Partner: UNT Libraries
Back to Top of Screen