Thesis (M.Sc.)--University of Hong Kong, 2003. / Includes bibliographical references (p. 116-117)

Digitized by Kansas State University Libraries

Thesis (M.S.)--University of Wisconsin--Madison, 1964. / eContent provider-neutral record in process. Description based on print version record. Bibliography: l. [53]-54.

published_or_final_version / Conservation / Master / Master of Science in Conservation

No description available.

Thesis (M. S.)--Mechanical Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Cunefare, Kenneth A.; Committee Member: Qu, Jianmin; Committee Member: Ryherd, Erica. Part of the SMARTech Electronic Thesis and Dissertation Collection.

We study universal cycles of the set P(n,k) of k-partitions of the set [n]:={1,2,…,n} and prove that the transition digraph associated with P(n,k) is Eulerian. But this does not imply that universal cycles (or ucycles) exist, since vertices represent equivalence classes of partitions. We use this result to prove, however, that ucycles of P(n,k) exist for all n≥3 when k=2. We reprove that they exist for odd n when k=n−1 and that they do not exist for even n when k=n−1. An infinite family of (n,k) for which ucycles do not exist is shown to be those pairs for which (Formula presented) is odd (3≤k

Let K(v,w) denote the complete graph on v vertices with a hole of size w (i.e., K(v, w) = Kv\Kw). We give necessary and sufficient conditions for the existence of a minimum 4-cycle covering of K (v,w).

Given a finite Weyl group W_fin with root system Phi_fin, one can create the affine Weyl group W_aff by taking the semidirect product of the translation group associated to the coroot lattice for Phi_fin, with W_fin. The double affine Weyl semigroup W can be created by using a similar semidirect product where one replaces W_fin with W_aff and the coroot lattice with the Tits cone of W_aff. We classify cocovers and covers of a given element of W with respect to the Bruhat order, specifically when W is associated to a finite root system that is irreducible and simply laced. We show two approaches: one extending the work of Lam and Shimozono, and its strengthening by Milicevic, where cocovers are characterized in the affine case using the quantum Bruhat graph of W_fin, and another, which takes a more geometrical approach by using the length difference set defined by Muthiah and Orr. / Doctor of Philosophy / The Bruhat order is a way of organizing elements of the double affine Weyl semigroup so that we have a better understanding of how the elements interact. In this dissertation, we study the Bruhat order, specifically looking for when two elements are separated by exactly one step in the order. We classify these elements and show that there are only finitely many of them.

Lisensiaatintyö -- Kuopion yliopisto. Ympäristötieteiden laitos. / Includes bibliographical references (p. 69-76). Also available on the World Wide Web.