Abstract

Linear characters of finite groups can be extended to take k operands. The basics of such a k-fold extension are detailed. We then examine a proposition by Johnson and Sehgal pertaining to these k-characters and disprove its converse. Probabilistic models can be applied to random walks on the Cayley groups of finite order. We examine random walks on dihedral groups which converge after a finite number of steps to the random walk induced by the uniform distribution. We present both sufficient and necessary conditions for such convergence and analyze aspects of algebraic geometry related to this subject.

Degree

MS

College and Department

Physical and Mathematical Sciences; Mathematics

Rights

http://lib.byu.edu/about/copyright/

Date Submitted

2015-06-01

Document Type

Thesis

Handle

http://hdl.lib.byu.edu/1877/etd8702

Keywords

k-characters, group determinant, random walks, branched covering

Included in

Mathematics Commons

Share

COinS