Search
Skip to Search Results-
Fall 2016
In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main contribution is a framework to build good constant-factor approximation algorithms for variants of the multi-depot $k$-travelling...
-
Spring 2011
A flag of a finite dimensional vector space V is a nested sequence of subspaces of V . The symplectic group of V acts on the set of flags of V . We classify the orbits of this action by defining the incidence matrix of a flag of V and show- ing that two flags are in the same orbit precisely when...
-
Fall 2009
In this paper we find irreducible characters of G=SL(k,Z/p^nZ) where n >= 2, k=2,3 and, p is an odd prime. In the case k=2 we give a construction for every irreducible character of G without calculating the character values. Our method is based on finding a normal subgroup of G and applying...
-
Fall 2016
Little is known about Vertex Operator Algebras (VOAs) which are neither semi-simple nor rational, and most of the work on such VOAs has been focused around specific examples such as the Singlet VOA. In this thesis, the relationship between subcategories of the module categories of the Singlet VOA...
-
Spring 2010
The traditional approach to the study of consumer behaviour is to regard them as isolated islands of preferences, needs, motives, and goals; however, this approach neglects the impact of ‘others’ on consumers’ judgments and preferences. For this reason, the theme of this thesis is the ‘connected...