Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(branched covering). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Oregon State University

1. Golbabaei, Sanaz. Branched Covering Space Construction and Visualization.

Degree: MS, Computer Science, 2016, Oregon State University

Branched covering spaces are a mathematical concept which originates from complex analysis and topology and has found applications in tensor field topology and geometry re-meshing.… (more)

Subjects/Keywords: branched covering space; Covering spaces (Topology)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Golbabaei, S. (2016). Branched Covering Space Construction and Visualization. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/59174

Chicago Manual of Style (16th Edition):

Golbabaei, Sanaz. “Branched Covering Space Construction and Visualization.” 2016. Masters Thesis, Oregon State University. Accessed September 29, 2020. http://hdl.handle.net/1957/59174.

MLA Handbook (7th Edition):

Golbabaei, Sanaz. “Branched Covering Space Construction and Visualization.” 2016. Web. 29 Sep 2020.

Vancouver:

Golbabaei S. Branched Covering Space Construction and Visualization. [Internet] [Masters thesis]. Oregon State University; 2016. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/1957/59174.

Council of Science Editors:

Golbabaei S. Branched Covering Space Construction and Visualization. [Masters Thesis]. Oregon State University; 2016. Available from: http://hdl.handle.net/1957/59174


Boise State University

2. Allyn, Tyler. Diagrammatically Reducible 2-Complexes.

Degree: 2014, Boise State University

 There are various ways one can try to extend the notion of a tree to higher dimensional cell complexes. Perhaps the most direct approach is… (more)

Subjects/Keywords: Diagrammatic Reducibility; Gauss-Bonnet; Weight Test; Branched Covering Spaces; 2-Complex; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Allyn, T. (2014). Diagrammatically Reducible 2-Complexes. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/815

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Allyn, Tyler. “Diagrammatically Reducible 2-Complexes.” 2014. Thesis, Boise State University. Accessed September 29, 2020. https://scholarworks.boisestate.edu/td/815.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Allyn, Tyler. “Diagrammatically Reducible 2-Complexes.” 2014. Web. 29 Sep 2020.

Vancouver:

Allyn T. Diagrammatically Reducible 2-Complexes. [Internet] [Thesis]. Boise State University; 2014. [cited 2020 Sep 29]. Available from: https://scholarworks.boisestate.edu/td/815.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Allyn T. Diagrammatically Reducible 2-Complexes. [Thesis]. Boise State University; 2014. Available from: https://scholarworks.boisestate.edu/td/815

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

3. Hughes, Mark Clifford. Branched Covering Constructions and the Symplectic Geography Problem.

Degree: 2008, University of Waterloo

 We apply branched covering techniques to construct minimal simply-connected symplectic 4-manifolds with small χh values. We also use these constructions to provide an alternate proof… (more)

Subjects/Keywords: 4-manifold; branched covering; symplectic geography; symplectic manifold

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hughes, M. C. (2008). Branched Covering Constructions and the Symplectic Geography Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3857

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hughes, Mark Clifford. “Branched Covering Constructions and the Symplectic Geography Problem.” 2008. Thesis, University of Waterloo. Accessed September 29, 2020. http://hdl.handle.net/10012/3857.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hughes, Mark Clifford. “Branched Covering Constructions and the Symplectic Geography Problem.” 2008. Web. 29 Sep 2020.

Vancouver:

Hughes MC. Branched Covering Constructions and the Symplectic Geography Problem. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10012/3857.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hughes MC. Branched Covering Constructions and the Symplectic Geography Problem. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3857

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. Reese, Randall Dean. Topics Pertaining to the Group Matrix: k-Characters and Random Walks.

Degree: MS, 2015, Brigham Young University

 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… (more)

Subjects/Keywords: k-characters; group determinant; random walks; branched covering; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Reese, R. D. (2015). Topics Pertaining to the Group Matrix: k-Characters and Random Walks. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd

Chicago Manual of Style (16th Edition):

Reese, Randall Dean. “Topics Pertaining to the Group Matrix: k-Characters and Random Walks.” 2015. Masters Thesis, Brigham Young University. Accessed September 29, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd.

MLA Handbook (7th Edition):

Reese, Randall Dean. “Topics Pertaining to the Group Matrix: k-Characters and Random Walks.” 2015. Web. 29 Sep 2020.

Vancouver:

Reese RD. Topics Pertaining to the Group Matrix: k-Characters and Random Walks. [Internet] [Masters thesis]. Brigham Young University; 2015. [cited 2020 Sep 29]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd.

Council of Science Editors:

Reese RD. Topics Pertaining to the Group Matrix: k-Characters and Random Walks. [Masters Thesis]. Brigham Young University; 2015. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd

5. Larsson, David. Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups.

Degree: Faculty of Science & Engineering, 2015, Linköping UniversityLinköping University

  The work of mathematical giants, such as Lobachevsky, Gauss, Riemann, Klein and Poincaré, to name a few, lies at the foundation of the study… (more)

Subjects/Keywords: Compact Riemann surfaces and uniformization; Fuchsian groups and automorphic functions; Hyperbolic geometry; Topological groups; Permutation groups; Computational methods; Covering spaces; branched coverings; Generators; relations; and presentations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Larsson, D. (2015). Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119916

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Larsson, David. “Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups.” 2015. Thesis, Linköping UniversityLinköping University. Accessed September 29, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119916.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Larsson, David. “Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups.” 2015. Web. 29 Sep 2020.

Vancouver:

Larsson D. Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups. [Internet] [Thesis]. Linköping UniversityLinköping University; 2015. [cited 2020 Sep 29]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119916.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Larsson D. Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups. [Thesis]. Linköping UniversityLinköping University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119916

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of North Texas

6. Tejada, Débora. Universal Branched Coverings.

Degree: 1993, University of North Texas

 In this paper, the study of k-fold branched coverings for which the branch set is a stratified set is considered. First of all, the existence… (more)

Subjects/Keywords: k-fold branched coverings; mathematics; CW-complexes; Brown's Representability Theorem; Covering spaces (Topology)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tejada, D. (1993). Universal Branched Coverings. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc279340/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tejada, Débora. “Universal Branched Coverings.” 1993. Thesis, University of North Texas. Accessed September 29, 2020. https://digital.library.unt.edu/ark:/67531/metadc279340/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tejada, Débora. “Universal Branched Coverings.” 1993. Web. 29 Sep 2020.

Vancouver:

Tejada D. Universal Branched Coverings. [Internet] [Thesis]. University of North Texas; 1993. [cited 2020 Sep 29]. Available from: https://digital.library.unt.edu/ark:/67531/metadc279340/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tejada D. Universal Branched Coverings. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc279340/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Casey, Meredith Perrie. Branched covers of contact manifolds.

Degree: PhD, Mathematics, 2013, Georgia Tech

 We will discuss what is known about the construction of contact structures via branched covers, emphasizing the search for universal transverse knots. Recall that a… (more)

Subjects/Keywords: Branched covers; Contact geometry; Contact manifolds; Topology; Manifolds (Mathematics); Three-manifolds (Topology); Covering spaces (Topology)

…understand contact structures via branched covering maps. Contact structures originally arose from… …manifolds. A map p : M → N is called a branched covering if there exists a co-dimension 2… …is a covering. We will study here manifolds of dimension 2 or 3. Essentially, a branched… …branched covering map is that of coloring the branch locus, which is defined in Chapter 3… …of branched covers and improvements on 3-manifold constructions. 3.1 Ordinary Covering… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Casey, M. P. (2013). Branched covers of contact manifolds. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/50313

Chicago Manual of Style (16th Edition):

Casey, Meredith Perrie. “Branched covers of contact manifolds.” 2013. Doctoral Dissertation, Georgia Tech. Accessed September 29, 2020. http://hdl.handle.net/1853/50313.

MLA Handbook (7th Edition):

Casey, Meredith Perrie. “Branched covers of contact manifolds.” 2013. Web. 29 Sep 2020.

Vancouver:

Casey MP. Branched covers of contact manifolds. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/1853/50313.

Council of Science Editors:

Casey MP. Branched covers of contact manifolds. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/50313


Kyoto University

8. Sugiyama, Toshi. The Moduli Space of Polynomial Maps and Their Fixed-Point Multipliers .

Degree: 2018, Kyoto University

Subjects/Keywords: complex dynamics; moduli space; polynomial map; fixed-point multiplier; Bezout's theorem; intersection multiplicity; branched covering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sugiyama, T. (2018). The Moduli Space of Polynomial Maps and Their Fixed-Point Multipliers . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/233819

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sugiyama, Toshi. “The Moduli Space of Polynomial Maps and Their Fixed-Point Multipliers .” 2018. Thesis, Kyoto University. Accessed September 29, 2020. http://hdl.handle.net/2433/233819.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sugiyama, Toshi. “The Moduli Space of Polynomial Maps and Their Fixed-Point Multipliers .” 2018. Web. 29 Sep 2020.

Vancouver:

Sugiyama T. The Moduli Space of Polynomial Maps and Their Fixed-Point Multipliers . [Internet] [Thesis]. Kyoto University; 2018. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/2433/233819.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sugiyama T. The Moduli Space of Polynomial Maps and Their Fixed-Point Multipliers . [Thesis]. Kyoto University; 2018. Available from: http://hdl.handle.net/2433/233819

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.