Show simple item record

dc.contributor Dixon, Martyn R.
dc.contributor Evans, Martin J.
dc.contributor Liem, Vo T.
dc.contributor Trace, Bruce S.
dc.contributor Trent, Tavan T.
dc.contributor Wu, Zhijian
dc.contributor Ratkovich, Thomas
dc.contributor.advisor Corson, Jon M. Acharyya, Amrita 2017-03-01T16:57:36Z 2017-03-01T16:57:36Z 2013
dc.identifier.other u0015_0000001_0001491
dc.identifier.other Acharyya_alatus_0004D_11784
dc.description Electronic Thesis or Dissertation
dc.description.abstract We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the classical theory of coverings of abstract graphs. For example, it makes sense to talk about the universal cover of a profinite graph and we show that it always exists and is unique. We define the profinite fundamental group of a profinite graph and show that a connected cover of a connected profinite graph is the universal cover if and only if its profinite fundamental group is trivial.
dc.format.extent 80 p.
dc.format.medium electronic
dc.format.mimetype application/pdf
dc.language English
dc.language.iso en_US
dc.publisher University of Alabama Libraries
dc.relation.ispartof The University of Alabama Electronic Theses and Dissertations
dc.relation.ispartof The University of Alabama Libraries Digital Collections
dc.relation.hasversion born digital
dc.rights All rights reserved by the author unless otherwise indicated.
dc.subject.other Mathematics
dc.title Coverings of profinite graphs
dc.type thesis
dc.type text University of Alabama. Dept. of Mathematics Mathematics The University of Alabama doctoral Ph.D.

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account