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:(Combinatorics). Showing records 1 – 30 of 745 total matches.

[1] [2] [3] [4] [5] … [25]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Minnesota

1. Williams, Nathan Ferd. Cataland.

Degree: PhD, Mathematics, 2013, University of Minnesota

 We study two combinatorial miracles relating purely poset-theoretic objects with purely Coxeter-theoretic objects. The first miracle is that there are the same number of linear… (more)

Subjects/Keywords: Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Williams, N. F. (2013). Cataland. (Doctoral Dissertation). University of Minnesota. Retrieved from http://purl.umn.edu/159973

Chicago Manual of Style (16th Edition):

Williams, Nathan Ferd. “Cataland.” 2013. Doctoral Dissertation, University of Minnesota. Accessed December 01, 2020. http://purl.umn.edu/159973.

MLA Handbook (7th Edition):

Williams, Nathan Ferd. “Cataland.” 2013. Web. 01 Dec 2020.

Vancouver:

Williams NF. Cataland. [Internet] [Doctoral dissertation]. University of Minnesota; 2013. [cited 2020 Dec 01]. Available from: http://purl.umn.edu/159973.

Council of Science Editors:

Williams NF. Cataland. [Doctoral Dissertation]. University of Minnesota; 2013. Available from: http://purl.umn.edu/159973


University of Oklahoma

2. Edwards, Craig. THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS.

Degree: PhD, 2019, University of Oklahoma

 Even though the problem of counting points with integer coordinates on a (rational) polytope has connections to sophisticated mathematical topics like Algebraic K-Theory, Fourier-Dedekind Sums,… (more)

Subjects/Keywords: Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Edwards, C. (2019). THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319674

Chicago Manual of Style (16th Edition):

Edwards, Craig. “THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS.” 2019. Doctoral Dissertation, University of Oklahoma. Accessed December 01, 2020. http://hdl.handle.net/11244/319674.

MLA Handbook (7th Edition):

Edwards, Craig. “THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS.” 2019. Web. 01 Dec 2020.

Vancouver:

Edwards C. THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS. [Internet] [Doctoral dissertation]. University of Oklahoma; 2019. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/11244/319674.

Council of Science Editors:

Edwards C. THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS. [Doctoral Dissertation]. University of Oklahoma; 2019. Available from: http://hdl.handle.net/11244/319674


University of Illinois – Urbana-Champaign

3. Wagner, Zsolt Adam. On some problems in extremal, probabilistic and enumerative combinatorics.

Degree: PhD, Mathematics, 2018, University of Illinois – Urbana-Champaign

 This is a study of a small selection of problems from various areas of Combinatorics and Graph Theory, a fast developing field that provides a… (more)

Subjects/Keywords: extremal combinatorics; probabilistic combinatorics; enumerative combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wagner, Z. A. (2018). On some problems in extremal, probabilistic and enumerative combinatorics. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100954

Chicago Manual of Style (16th Edition):

Wagner, Zsolt Adam. “On some problems in extremal, probabilistic and enumerative combinatorics.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 01, 2020. http://hdl.handle.net/2142/100954.

MLA Handbook (7th Edition):

Wagner, Zsolt Adam. “On some problems in extremal, probabilistic and enumerative combinatorics.” 2018. Web. 01 Dec 2020.

Vancouver:

Wagner ZA. On some problems in extremal, probabilistic and enumerative combinatorics. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/2142/100954.

Council of Science Editors:

Wagner ZA. On some problems in extremal, probabilistic and enumerative combinatorics. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100954

4. Morrill, Thomas. Overpartition Ranks, Cranks, and Frobenius Representations.

Degree: PhD, 2017, Oregon State University

 We generalize overpartition rank and crank generating functions to obtain k-fold variants, and give a combinatorial interpretation for each. The k-fold crank generating function is… (more)

Subjects/Keywords: Combinatorics

…A powerful tool in combinatorics is the generating series, which is a power series X n≥0… …analytic functions of τ under these conditions. In this light, the combinatorics of partitions… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morrill, T. (2017). Overpartition Ranks, Cranks, and Frobenius Representations. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/61616

Chicago Manual of Style (16th Edition):

Morrill, Thomas. “Overpartition Ranks, Cranks, and Frobenius Representations.” 2017. Doctoral Dissertation, Oregon State University. Accessed December 01, 2020. http://hdl.handle.net/1957/61616.

MLA Handbook (7th Edition):

Morrill, Thomas. “Overpartition Ranks, Cranks, and Frobenius Representations.” 2017. Web. 01 Dec 2020.

Vancouver:

Morrill T. Overpartition Ranks, Cranks, and Frobenius Representations. [Internet] [Doctoral dissertation]. Oregon State University; 2017. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1957/61616.

Council of Science Editors:

Morrill T. Overpartition Ranks, Cranks, and Frobenius Representations. [Doctoral Dissertation]. Oregon State University; 2017. Available from: http://hdl.handle.net/1957/61616


University of Melbourne

5. Foxcroft, John Spencer Hugh. Combinatorial enumeration and the Bethe Ansatz.

Degree: 2017, University of Melbourne

 This thesis focuses on combinatorial enumeration of lattice paths using the Constant Term method. In particular we make use of the Bethe Ansatz, an Ansatz… (more)

Subjects/Keywords: combinatorics; enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Foxcroft, J. S. H. (2017). Combinatorial enumeration and the Bethe Ansatz. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/210785

Chicago Manual of Style (16th Edition):

Foxcroft, John Spencer Hugh. “Combinatorial enumeration and the Bethe Ansatz.” 2017. Doctoral Dissertation, University of Melbourne. Accessed December 01, 2020. http://hdl.handle.net/11343/210785.

MLA Handbook (7th Edition):

Foxcroft, John Spencer Hugh. “Combinatorial enumeration and the Bethe Ansatz.” 2017. Web. 01 Dec 2020.

Vancouver:

Foxcroft JSH. Combinatorial enumeration and the Bethe Ansatz. [Internet] [Doctoral dissertation]. University of Melbourne; 2017. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/11343/210785.

Council of Science Editors:

Foxcroft JSH. Combinatorial enumeration and the Bethe Ansatz. [Doctoral Dissertation]. University of Melbourne; 2017. Available from: http://hdl.handle.net/11343/210785


University of Florida

6. Copenhaver, Keith J. Distance Statistics in Rooted Trees.

Degree: PhD, Mathematics, 2019, University of Florida

 We consider various statistics in the setting of rooted trees in graph theory. We present a general background to graph theory, and give some examples… (more)

Subjects/Keywords: combinatorics  – mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Copenhaver, K. J. (2019). Distance Statistics in Rooted Trees. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0054322

Chicago Manual of Style (16th Edition):

Copenhaver, Keith J. “Distance Statistics in Rooted Trees.” 2019. Doctoral Dissertation, University of Florida. Accessed December 01, 2020. https://ufdc.ufl.edu/UFE0054322.

MLA Handbook (7th Edition):

Copenhaver, Keith J. “Distance Statistics in Rooted Trees.” 2019. Web. 01 Dec 2020.

Vancouver:

Copenhaver KJ. Distance Statistics in Rooted Trees. [Internet] [Doctoral dissertation]. University of Florida; 2019. [cited 2020 Dec 01]. Available from: https://ufdc.ufl.edu/UFE0054322.

Council of Science Editors:

Copenhaver KJ. Distance Statistics in Rooted Trees. [Doctoral Dissertation]. University of Florida; 2019. Available from: https://ufdc.ufl.edu/UFE0054322


University of Waterloo

7. Chan, Kelvin Tian Yi. Induction Relations in the Symmetric Groups and Jucys-Murphy Elements.

Degree: 2018, University of Waterloo

 Transitive factorizations faithfully encode many interesting objects. The well-known ones include ramified coverings of the sphere and hypermaps. Enumeration of specific classes of such objects… (more)

Subjects/Keywords: Algebraic Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chan, K. T. Y. (2018). Induction Relations in the Symmetric Groups and Jucys-Murphy Elements. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13601

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):

Chan, Kelvin Tian Yi. “Induction Relations in the Symmetric Groups and Jucys-Murphy Elements.” 2018. Thesis, University of Waterloo. Accessed December 01, 2020. http://hdl.handle.net/10012/13601.

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

MLA Handbook (7th Edition):

Chan, Kelvin Tian Yi. “Induction Relations in the Symmetric Groups and Jucys-Murphy Elements.” 2018. Web. 01 Dec 2020.

Vancouver:

Chan KTY. Induction Relations in the Symmetric Groups and Jucys-Murphy Elements. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10012/13601.

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

Council of Science Editors:

Chan KTY. Induction Relations in the Symmetric Groups and Jucys-Murphy Elements. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13601

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


Rutgers University

8. Scheinerman, Daniel, 1986-. Several problems in linear algebraic and additive combinatorics.

Degree: PhD, Mathematics, 2019, Rutgers University

This thesis studies three problems in linear algebraic and additive combinatorics. Our first result gives new upper bounds for the determinant of an nimes n… (more)

Subjects/Keywords: Additive combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Scheinerman, Daniel, 1. (2019). Several problems in linear algebraic and additive combinatorics. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/61005/

Chicago Manual of Style (16th Edition):

Scheinerman, Daniel, 1986-. “Several problems in linear algebraic and additive combinatorics.” 2019. Doctoral Dissertation, Rutgers University. Accessed December 01, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/61005/.

MLA Handbook (7th Edition):

Scheinerman, Daniel, 1986-. “Several problems in linear algebraic and additive combinatorics.” 2019. Web. 01 Dec 2020.

Vancouver:

Scheinerman, Daniel 1. Several problems in linear algebraic and additive combinatorics. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2020 Dec 01]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61005/.

Council of Science Editors:

Scheinerman, Daniel 1. Several problems in linear algebraic and additive combinatorics. [Doctoral Dissertation]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61005/


University of Guelph

9. Styner, Dustin. A Collection of Results of Simonyi's Conjecture.

Degree: MS, Department of Mathematics and Statistics, 2012, University of Guelph

 ℬ| ≤  2n. This conjecture is the focus of this thesis. This thesis contains a collection of proofs of special cases that together form a complete… (more)

Subjects/Keywords: Combinatorics; Set Theory; Extremal Combinatorics; Graph Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Styner, D. (2012). A Collection of Results of Simonyi's Conjecture. (Masters Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926

Chicago Manual of Style (16th Edition):

Styner, Dustin. “A Collection of Results of Simonyi's Conjecture.” 2012. Masters Thesis, University of Guelph. Accessed December 01, 2020. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926.

MLA Handbook (7th Edition):

Styner, Dustin. “A Collection of Results of Simonyi's Conjecture.” 2012. Web. 01 Dec 2020.

Vancouver:

Styner D. A Collection of Results of Simonyi's Conjecture. [Internet] [Masters thesis]. University of Guelph; 2012. [cited 2020 Dec 01]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926.

Council of Science Editors:

Styner D. A Collection of Results of Simonyi's Conjecture. [Masters Thesis]. University of Guelph; 2012. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926


University of Cambridge

10. Przykucki, Michał Jan. Extremal and probabilistic bootstrap percolation.

Degree: PhD, 2013, University of Cambridge

 In this dissertation we consider several extremal and probabilistic problems in bootstrap percolation on various families of graphs, including grids, hypercubes and trees. Bootstrap percolation… (more)

Subjects/Keywords: Bootstrap percolation; Probabilistic combinatorics; Extremal combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Przykucki, M. J. (2013). Extremal and probabilistic bootstrap percolation. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg

Chicago Manual of Style (16th Edition):

Przykucki, Michał Jan. “Extremal and probabilistic bootstrap percolation.” 2013. Doctoral Dissertation, University of Cambridge. Accessed December 01, 2020. https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg.

MLA Handbook (7th Edition):

Przykucki, Michał Jan. “Extremal and probabilistic bootstrap percolation.” 2013. Web. 01 Dec 2020.

Vancouver:

Przykucki MJ. Extremal and probabilistic bootstrap percolation. [Internet] [Doctoral dissertation]. University of Cambridge; 2013. [cited 2020 Dec 01]. Available from: https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg.

Council of Science Editors:

Przykucki MJ. Extremal and probabilistic bootstrap percolation. [Doctoral Dissertation]. University of Cambridge; 2013. Available from: https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg


University of Oxford

11. Weller, Kerstin B. Connectivity and related properties for graph classes.

Degree: PhD, 2014, University of Oxford

 There has been much recent interest in random graphs sampled uniformly from the set of (labelled) graphs on n vertices in a suitably structured class… (more)

Subjects/Keywords: 511; Combinatorics; Graph Theory; Analytic Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weller, K. B. (2014). Connectivity and related properties for graph classes. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030

Chicago Manual of Style (16th Edition):

Weller, Kerstin B. “Connectivity and related properties for graph classes.” 2014. Doctoral Dissertation, University of Oxford. Accessed December 01, 2020. http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030.

MLA Handbook (7th Edition):

Weller, Kerstin B. “Connectivity and related properties for graph classes.” 2014. Web. 01 Dec 2020.

Vancouver:

Weller KB. Connectivity and related properties for graph classes. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2020 Dec 01]. Available from: http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030.

Council of Science Editors:

Weller KB. Connectivity and related properties for graph classes. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030


Oregon State University

12. Erickson, Sarah A. Listing as a Potential Connection between Sets of Outcomes and Counting Processes.

Degree: MS, Mathematics, 2015, Oregon State University

 Counting problems are rich in opportunities for students to make meaningful mathematical connections and develop non-algorithmic thinking; their accessible nature and applications to computer science… (more)

Subjects/Keywords: combinatorics; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Erickson, S. A. (2015). Listing as a Potential Connection between Sets of Outcomes and Counting Processes. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/57952

Chicago Manual of Style (16th Edition):

Erickson, Sarah A. “Listing as a Potential Connection between Sets of Outcomes and Counting Processes.” 2015. Masters Thesis, Oregon State University. Accessed December 01, 2020. http://hdl.handle.net/1957/57952.

MLA Handbook (7th Edition):

Erickson, Sarah A. “Listing as a Potential Connection between Sets of Outcomes and Counting Processes.” 2015. Web. 01 Dec 2020.

Vancouver:

Erickson SA. Listing as a Potential Connection between Sets of Outcomes and Counting Processes. [Internet] [Masters thesis]. Oregon State University; 2015. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1957/57952.

Council of Science Editors:

Erickson SA. Listing as a Potential Connection between Sets of Outcomes and Counting Processes. [Masters Thesis]. Oregon State University; 2015. Available from: http://hdl.handle.net/1957/57952


University of Toronto

13. Li, Xiang. On the Logarithimic Calculus and Sidorenko's Conjecture.

Degree: 2011, University of Toronto

We study a type of calculus for proving inequalities between subgraph densities which is based on Jensen's inequality for the logarithmic function. As a demonstration… (more)

Subjects/Keywords: Combinatorics; Probability; 0280

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, X. (2011). On the Logarithimic Calculus and Sidorenko's Conjecture. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31311

Chicago Manual of Style (16th Edition):

Li, Xiang. “On the Logarithimic Calculus and Sidorenko's Conjecture.” 2011. Masters Thesis, University of Toronto. Accessed December 01, 2020. http://hdl.handle.net/1807/31311.

MLA Handbook (7th Edition):

Li, Xiang. “On the Logarithimic Calculus and Sidorenko's Conjecture.” 2011. Web. 01 Dec 2020.

Vancouver:

Li X. On the Logarithimic Calculus and Sidorenko's Conjecture. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1807/31311.

Council of Science Editors:

Li X. On the Logarithimic Calculus and Sidorenko's Conjecture. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31311


Colorado State University

14. Cooper, Benjamin C. Abstract hyperovals, partial geometries, and transitive hyperovals.

Degree: PhD, Mathematics, 2015, Colorado State University

 A hyperoval is a (q+2)- arc of a projective plane π, of order q with q even. Let G denote the collineation group of π… (more)

Subjects/Keywords: finite geometry; combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cooper, B. C. (2015). Abstract hyperovals, partial geometries, and transitive hyperovals. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/167107

Chicago Manual of Style (16th Edition):

Cooper, Benjamin C. “Abstract hyperovals, partial geometries, and transitive hyperovals.” 2015. Doctoral Dissertation, Colorado State University. Accessed December 01, 2020. http://hdl.handle.net/10217/167107.

MLA Handbook (7th Edition):

Cooper, Benjamin C. “Abstract hyperovals, partial geometries, and transitive hyperovals.” 2015. Web. 01 Dec 2020.

Vancouver:

Cooper BC. Abstract hyperovals, partial geometries, and transitive hyperovals. [Internet] [Doctoral dissertation]. Colorado State University; 2015. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10217/167107.

Council of Science Editors:

Cooper BC. Abstract hyperovals, partial geometries, and transitive hyperovals. [Doctoral Dissertation]. Colorado State University; 2015. Available from: http://hdl.handle.net/10217/167107

15. Narayanan, Bhargav. Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory.

Degree: PhD, 2015, University of Cambridge

In this dissertation, we treat several problems in Ramsey theory, probabilistic combinatorics and extremal graph theory.

Subjects/Keywords: Combinatorics; Probability theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Narayanan, B. (2015). Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/252850https://www.repository.cam.ac.uk/bitstream/1810/252850/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/252850/3/license_rdf ; https://www.repository.cam.ac.uk/bitstream/1810/252850/4/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/252850/5/thesis.pdf.jpg

Chicago Manual of Style (16th Edition):

Narayanan, Bhargav. “Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory.” 2015. Doctoral Dissertation, University of Cambridge. Accessed December 01, 2020. https://www.repository.cam.ac.uk/handle/1810/252850https://www.repository.cam.ac.uk/bitstream/1810/252850/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/252850/3/license_rdf ; https://www.repository.cam.ac.uk/bitstream/1810/252850/4/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/252850/5/thesis.pdf.jpg.

MLA Handbook (7th Edition):

Narayanan, Bhargav. “Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory.” 2015. Web. 01 Dec 2020.

Vancouver:

Narayanan B. Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory. [Internet] [Doctoral dissertation]. University of Cambridge; 2015. [cited 2020 Dec 01]. Available from: https://www.repository.cam.ac.uk/handle/1810/252850https://www.repository.cam.ac.uk/bitstream/1810/252850/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/252850/3/license_rdf ; https://www.repository.cam.ac.uk/bitstream/1810/252850/4/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/252850/5/thesis.pdf.jpg.

Council of Science Editors:

Narayanan B. Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory. [Doctoral Dissertation]. University of Cambridge; 2015. Available from: https://www.repository.cam.ac.uk/handle/1810/252850https://www.repository.cam.ac.uk/bitstream/1810/252850/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/252850/3/license_rdf ; https://www.repository.cam.ac.uk/bitstream/1810/252850/4/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/252850/5/thesis.pdf.jpg


Queen Mary, University of London

16. Pinto, Trevor Alvaro Anthony. Extremal problems on the hypercube.

Degree: PhD, 2016, Queen Mary, University of London

 The hypercube, Qd, is a natural and much studied combinatorial object, and we discuss various extremal problems related to it. A subgraph of the hypercube… (more)

Subjects/Keywords: Combinatorics; Mathematical Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pinto, T. A. A. (2016). Extremal problems on the hypercube. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812

Chicago Manual of Style (16th Edition):

Pinto, Trevor Alvaro Anthony. “Extremal problems on the hypercube.” 2016. Doctoral Dissertation, Queen Mary, University of London. Accessed December 01, 2020. http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812.

MLA Handbook (7th Edition):

Pinto, Trevor Alvaro Anthony. “Extremal problems on the hypercube.” 2016. Web. 01 Dec 2020.

Vancouver:

Pinto TAA. Extremal problems on the hypercube. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2016. [cited 2020 Dec 01]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812.

Council of Science Editors:

Pinto TAA. Extremal problems on the hypercube. [Doctoral Dissertation]. Queen Mary, University of London; 2016. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812


University of Waterloo

17. Nelson, Peter. Exponentially Dense Matroids.

Degree: 2011, University of Waterloo

 This thesis deals with questions relating to the maximum density of rank-n matroids in a minor-closed class. Consider a minor-closed class M of matroids that… (more)

Subjects/Keywords: Matroid; Mathematics; Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelson, P. (2011). Exponentially Dense Matroids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6399

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):

Nelson, Peter. “Exponentially Dense Matroids.” 2011. Thesis, University of Waterloo. Accessed December 01, 2020. http://hdl.handle.net/10012/6399.

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

MLA Handbook (7th Edition):

Nelson, Peter. “Exponentially Dense Matroids.” 2011. Web. 01 Dec 2020.

Vancouver:

Nelson P. Exponentially Dense Matroids. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10012/6399.

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

Council of Science Editors:

Nelson P. Exponentially Dense Matroids. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6399

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


University of Cambridge

18. Milicevic, Luka. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.

Degree: PhD, 2018, University of Cambridge

 In this thesis, we consider several combinatorial topics, belonging to the areas appearing in the thesis title. Given a non-empty complete metric space (X,d), a… (more)

Subjects/Keywords: combinatorics; graph theory; extremal combinatorics; metric geometry; combinatorial geometry; additive combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Milicevic, L. (2018). Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/273375

Chicago Manual of Style (16th Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Doctoral Dissertation, University of Cambridge. Accessed December 01, 2020. https://www.repository.cam.ac.uk/handle/1810/273375.

MLA Handbook (7th Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Web. 01 Dec 2020.

Vancouver:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Dec 01]. Available from: https://www.repository.cam.ac.uk/handle/1810/273375.

Council of Science Editors:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/273375


Queen Mary, University of London

19. Falgas-Ravry, Victor. Thresholds in probabilistic and extremal combinatorics.

Degree: PhD, 2012, Queen Mary, University of London

 This thesis lies in the field of probabilistic and extremal combinatorics: we study discrete structures, with a focus on thresholds, when the behaviour of a… (more)

Subjects/Keywords: 519.2; Mathematics; Combinatorics; Discrete structures; Probabilistic combinatorics; Extremal combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Falgas-Ravry, V. (2012). Thresholds in probabilistic and extremal combinatorics. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640

Chicago Manual of Style (16th Edition):

Falgas-Ravry, Victor. “Thresholds in probabilistic and extremal combinatorics.” 2012. Doctoral Dissertation, Queen Mary, University of London. Accessed December 01, 2020. http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640.

MLA Handbook (7th Edition):

Falgas-Ravry, Victor. “Thresholds in probabilistic and extremal combinatorics.” 2012. Web. 01 Dec 2020.

Vancouver:

Falgas-Ravry V. Thresholds in probabilistic and extremal combinatorics. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2012. [cited 2020 Dec 01]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640.

Council of Science Editors:

Falgas-Ravry V. Thresholds in probabilistic and extremal combinatorics. [Doctoral Dissertation]. Queen Mary, University of London; 2012. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640


University of Rochester

20. Murphy, Brendan; Iosevich, Alex (1967 - ). Group actions in arithmetic combinatorics.

Degree: PhD, 2017, University of Rochester

 The subject of this dissertation is approximate group actions. This subject is a synthesis of arithmetic combinatorics, which is the study of subsets of commutative… (more)

Subjects/Keywords: Additive combinatorics; Approximate group theory; Combinatorics; Geometric combinatorics; Group action; Sum-product problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Murphy, Brendan; Iosevich, A. (. -. ). (2017). Group actions in arithmetic combinatorics. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/31885

Chicago Manual of Style (16th Edition):

Murphy, Brendan; Iosevich, Alex (1967 - ). “Group actions in arithmetic combinatorics.” 2017. Doctoral Dissertation, University of Rochester. Accessed December 01, 2020. http://hdl.handle.net/1802/31885.

MLA Handbook (7th Edition):

Murphy, Brendan; Iosevich, Alex (1967 - ). “Group actions in arithmetic combinatorics.” 2017. Web. 01 Dec 2020.

Vancouver:

Murphy, Brendan; Iosevich A(-). Group actions in arithmetic combinatorics. [Internet] [Doctoral dissertation]. University of Rochester; 2017. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1802/31885.

Council of Science Editors:

Murphy, Brendan; Iosevich A(-). Group actions in arithmetic combinatorics. [Doctoral Dissertation]. University of Rochester; 2017. Available from: http://hdl.handle.net/1802/31885


University of Cambridge

21. David, Stefan. Extremal combinatorics and universal algorithms.

Degree: PhD, 2018, University of Cambridge

 In this dissertation we solve several combinatorial problems in different areas of mathematics: automata theory, combinatorics of partially ordered sets and extremal combinatorics. Firstly, we… (more)

Subjects/Keywords: 511; Combinatorics; Extremal Combinatorics; Algorithms; Automata theory; Bootstrap percolation; Combinatorics of partially ordered sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

David, S. (2018). Extremal combinatorics and universal algorithms. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

Chicago Manual of Style (16th Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Doctoral Dissertation, University of Cambridge. Accessed December 01, 2020. https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

MLA Handbook (7th Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Web. 01 Dec 2020.

Vancouver:

David S. Extremal combinatorics and universal algorithms. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Dec 01]. Available from: https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

Council of Science Editors:

David S. Extremal combinatorics and universal algorithms. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383


Dalhousie University

22. Cox, Danielle. On Network Reliability.

Degree: PhD, Department of Mathematics & Statistics - Math Division, 2013, Dalhousie University

 The all terminal reliability of a graph G is the probability that at least a spanning tree is operational, given that vertices are always operational… (more)

Subjects/Keywords: Polynomials; Combinatorics; Network reliability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cox, D. (2013). On Network Reliability. (Doctoral Dissertation). Dalhousie University. Retrieved from http://hdl.handle.net/10222/27775

Chicago Manual of Style (16th Edition):

Cox, Danielle. “On Network Reliability.” 2013. Doctoral Dissertation, Dalhousie University. Accessed December 01, 2020. http://hdl.handle.net/10222/27775.

MLA Handbook (7th Edition):

Cox, Danielle. “On Network Reliability.” 2013. Web. 01 Dec 2020.

Vancouver:

Cox D. On Network Reliability. [Internet] [Doctoral dissertation]. Dalhousie University; 2013. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10222/27775.

Council of Science Editors:

Cox D. On Network Reliability. [Doctoral Dissertation]. Dalhousie University; 2013. Available from: http://hdl.handle.net/10222/27775


University of California – San Diego

23. Cummings, Jonathan James. Flips and Juggles.

Degree: Mathematics, 2016, University of California – San Diego

 In this dissertation we study juggling card sequences and edge flipping in graphs, as well as some related problems. Juggling patterns can be described by… (more)

Subjects/Keywords: Mathematics; Combinatorics; Graph Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cummings, J. J. (2016). Flips and Juggles. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/4vn913nb

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):

Cummings, Jonathan James. “Flips and Juggles.” 2016. Thesis, University of California – San Diego. Accessed December 01, 2020. http://www.escholarship.org/uc/item/4vn913nb.

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

MLA Handbook (7th Edition):

Cummings, Jonathan James. “Flips and Juggles.” 2016. Web. 01 Dec 2020.

Vancouver:

Cummings JJ. Flips and Juggles. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2020 Dec 01]. Available from: http://www.escholarship.org/uc/item/4vn913nb.

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

Council of Science Editors:

Cummings JJ. Flips and Juggles. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/4vn913nb

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


University of California – Berkeley

24. Lin, Bo. Combinatorics and Computations in Tropical Mathematics.

Degree: Mathematics, 2017, University of California – Berkeley

 In recent decades, tropical mathematics gradually evolved as a field of study in mathematics and it has more and more interactions with other fields and… (more)

Subjects/Keywords: Mathematics; combinatorics; computation; tropical geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, B. (2017). Combinatorics and Computations in Tropical Mathematics. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7cv95652

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):

Lin, Bo. “Combinatorics and Computations in Tropical Mathematics.” 2017. Thesis, University of California – Berkeley. Accessed December 01, 2020. http://www.escholarship.org/uc/item/7cv95652.

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

MLA Handbook (7th Edition):

Lin, Bo. “Combinatorics and Computations in Tropical Mathematics.” 2017. Web. 01 Dec 2020.

Vancouver:

Lin B. Combinatorics and Computations in Tropical Mathematics. [Internet] [Thesis]. University of California – Berkeley; 2017. [cited 2020 Dec 01]. Available from: http://www.escholarship.org/uc/item/7cv95652.

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

Council of Science Editors:

Lin B. Combinatorics and Computations in Tropical Mathematics. [Thesis]. University of California – Berkeley; 2017. Available from: http://www.escholarship.org/uc/item/7cv95652

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


UCLA

25. Miner, Samuel Alexander. Limit Shapes of Restricted Permutations.

Degree: Mathematics, 2015, UCLA

 Following the techniques initiated in , we continue to study the limit shapes of random permutations avoiding a specific subset of patterns. We consider patterns… (more)

Subjects/Keywords: Mathematics; combinatorics; discrete mathematics; mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Miner, S. A. (2015). Limit Shapes of Restricted Permutations. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/2zr5v8vb

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):

Miner, Samuel Alexander. “Limit Shapes of Restricted Permutations.” 2015. Thesis, UCLA. Accessed December 01, 2020. http://www.escholarship.org/uc/item/2zr5v8vb.

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

MLA Handbook (7th Edition):

Miner, Samuel Alexander. “Limit Shapes of Restricted Permutations.” 2015. Web. 01 Dec 2020.

Vancouver:

Miner SA. Limit Shapes of Restricted Permutations. [Internet] [Thesis]. UCLA; 2015. [cited 2020 Dec 01]. Available from: http://www.escholarship.org/uc/item/2zr5v8vb.

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

Council of Science Editors:

Miner SA. Limit Shapes of Restricted Permutations. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/2zr5v8vb

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


UCLA

26. Naves, Humberto Silva. On Combinatorial Problems of Extremal Nature and Games.

Degree: Mathematics, 2014, UCLA

 Extremal graph theory is a branch of discrete mathematics and alsothe central theme of extremal combinatorics. It studies graphs which areextremal with respect to some… (more)

Subjects/Keywords: Mathematics; Combinatorics; Probabilisitc method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naves, H. S. (2014). On Combinatorial Problems of Extremal Nature and Games. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/6df2p9gk

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):

Naves, Humberto Silva. “On Combinatorial Problems of Extremal Nature and Games.” 2014. Thesis, UCLA. Accessed December 01, 2020. http://www.escholarship.org/uc/item/6df2p9gk.

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

MLA Handbook (7th Edition):

Naves, Humberto Silva. “On Combinatorial Problems of Extremal Nature and Games.” 2014. Web. 01 Dec 2020.

Vancouver:

Naves HS. On Combinatorial Problems of Extremal Nature and Games. [Internet] [Thesis]. UCLA; 2014. [cited 2020 Dec 01]. Available from: http://www.escholarship.org/uc/item/6df2p9gk.

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

Council of Science Editors:

Naves HS. On Combinatorial Problems of Extremal Nature and Games. [Thesis]. UCLA; 2014. Available from: http://www.escholarship.org/uc/item/6df2p9gk

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


University of Rochester

27. Bennett, Michael B. Some extremal problems in combinatorial geometry over finite fields.

Degree: PhD, 2015, University of Rochester

 We will be examining a number of extremal problems in combinatorial geometry where our ambient space is a vector space over a finite field. In… (more)

Subjects/Keywords: Combinatorics; Finite fields; Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bennett, M. B. (2015). Some extremal problems in combinatorial geometry over finite fields. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/29586

Chicago Manual of Style (16th Edition):

Bennett, Michael B. “Some extremal problems in combinatorial geometry over finite fields.” 2015. Doctoral Dissertation, University of Rochester. Accessed December 01, 2020. http://hdl.handle.net/1802/29586.

MLA Handbook (7th Edition):

Bennett, Michael B. “Some extremal problems in combinatorial geometry over finite fields.” 2015. Web. 01 Dec 2020.

Vancouver:

Bennett MB. Some extremal problems in combinatorial geometry over finite fields. [Internet] [Doctoral dissertation]. University of Rochester; 2015. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1802/29586.

Council of Science Editors:

Bennett MB. Some extremal problems in combinatorial geometry over finite fields. [Doctoral Dissertation]. University of Rochester; 2015. Available from: http://hdl.handle.net/1802/29586


Rochester Institute of Technology

28. Nelson, Trevor. Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters.

Degree: MS, School of Mathematical Sciences (COS), 2018, Rochester Institute of Technology

  The aim of this thesis is to show how the use of parity in tandem with the triangular grid as well as a newly… (more)

Subjects/Keywords: Combinatorics; Convex; Drafters; Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelson, T. (2018). Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9776

Chicago Manual of Style (16th Edition):

Nelson, Trevor. “Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters.” 2018. Masters Thesis, Rochester Institute of Technology. Accessed December 01, 2020. https://scholarworks.rit.edu/theses/9776.

MLA Handbook (7th Edition):

Nelson, Trevor. “Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters.” 2018. Web. 01 Dec 2020.

Vancouver:

Nelson T. Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters. [Internet] [Masters thesis]. Rochester Institute of Technology; 2018. [cited 2020 Dec 01]. Available from: https://scholarworks.rit.edu/theses/9776.

Council of Science Editors:

Nelson T. Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters. [Masters Thesis]. Rochester Institute of Technology; 2018. Available from: https://scholarworks.rit.edu/theses/9776


Temple University

29. Dobbins, Michael Gene. Representations of Polytopes.

Degree: PhD, 2011, Temple University

Mathematics

Here we investigate a variety of ways to represent polytopes and related objects. We define a class of posets, which includes all abstract polytopes,… (more)

Subjects/Keywords: Mathematics; Combinatorics; Discrete Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dobbins, M. G. (2011). Representations of Polytopes. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,141523

Chicago Manual of Style (16th Edition):

Dobbins, Michael Gene. “Representations of Polytopes.” 2011. Doctoral Dissertation, Temple University. Accessed December 01, 2020. http://digital.library.temple.edu/u?/p245801coll10,141523.

MLA Handbook (7th Edition):

Dobbins, Michael Gene. “Representations of Polytopes.” 2011. Web. 01 Dec 2020.

Vancouver:

Dobbins MG. Representations of Polytopes. [Internet] [Doctoral dissertation]. Temple University; 2011. [cited 2020 Dec 01]. Available from: http://digital.library.temple.edu/u?/p245801coll10,141523.

Council of Science Editors:

Dobbins MG. Representations of Polytopes. [Doctoral Dissertation]. Temple University; 2011. Available from: http://digital.library.temple.edu/u?/p245801coll10,141523


University of Tasmania

30. Ham, NC. The planar modular partition monoid.

Degree: 2016, University of Tasmania

 The primary contribution of this thesis is to introduce and examine the planar modular partition monoid for parameters m, k ∈ Z>0, which has simultaneously… (more)

Subjects/Keywords: Algebra; Combinatorics; Discrete Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ham, N. (2016). The planar modular partition monoid. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

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):

Ham, NC. “The planar modular partition monoid.” 2016. Thesis, University of Tasmania. Accessed December 01, 2020. https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf.

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

MLA Handbook (7th Edition):

Ham, NC. “The planar modular partition monoid.” 2016. Web. 01 Dec 2020.

Vancouver:

Ham N. The planar modular partition monoid. [Internet] [Thesis]. University of Tasmania; 2016. [cited 2020 Dec 01]. Available from: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf.

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

Council of Science Editors:

Ham N. The planar modular partition monoid. [Thesis]. University of Tasmania; 2016. Available from: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

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

[1] [2] [3] [4] [5] … [25]

.