• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Classifying triply-invariant subspaces for p = 3

Wojtasinski, Justyna Agata. January 2008 (has links)
Thesis (M.S.)--University of Akron, Dept. of Mathematics, 2008. / "May, 2008." Title from electronic thesis title page (viewed 07/12/2008) Advisor, Jeffrey M. Riedl; Faculty Readers, Ethel Wheland, Stuart Clay; Department Chair, Joseph Wilder; Dean of the College, Ronald F. Levant; Dean of the Graduate School, George R. Newkome. Includes bibliographical references.
2

Classification of doubly-invariant subgroups for p = 2

Felix, Christina M. January 2008 (has links)
Thesis (M.S.)--University of Akron, Dept. of Mathematics, 2008. / "May, 2008." Title from electronic thesis title page (viewed 07/12/2008) Advisor, Jeffrey M. Riedl; Faculty Readers, William S. Clary, Ethel R. Wheland; Department Chair, Joseph W. Wilder; Dean of the College, Ronald F. Levant; Dean of the Graduate School, George R. Newkome. Includes bibliographical references.
3

Understanding Voting for Committees Using Wreath Products

Lee, Stephen C. 30 May 2010 (has links)
In this thesis, we construct an algebraic framework for analyzing committee elections. In this framework, module homomorphisms are used to model positional voting procedures. Using the action of the wreath product group S2[Sn] on these modules, we obtain module decompositions which help us to gain an understanding of the module homomorphism. We use these decompositions to construct some interesting voting paradoxes.

Page generated in 0.0507 seconds