Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(combinatorics)`

.
Showing records 1 – 30 of
689 total matches.

◁ [1] [2] [3] [4] [5] … [23] ▶

Search Limiters

Dates

- 2016 – 2020 (272)
- 2011 – 2015 (287)
- 2006 – 2010 (122)
- 2001 – 2005 (23)

Universities

- East Tennessee State University (48)
- University of Waterloo (40)
- University of Kentucky (23)
- University of Illinois – Urbana-Champaign (19)
- University of Oxford (19)
- ETH Zürich (17)
- Georgia Southern University (15)
- Western Kentucky University (15)
- University of Cambridge (12)
- University of Victoria (11)
- Freie Universität Berlin (10)

Department

- Mathematics (136)
- Mathematical Sciences (61)
- Informatique (29)
- Department of Mathematical Sciences (23)
- Department of Mathematics (18)
- Mathématiques (11)

Degrees

- PhD (188)
- MS (111)
- Docteur es (58)
- MSin Mathematics (M.S.) (15)

Languages

- English (353)
- French (40)
- Portuguese (19)

▼ Search Limiters

University of Oklahoma

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

Degree: PhD, 2019, University of Oklahoma

URL: http://hdl.handle.net/11244/319674

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Edwards, Craig. “THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS.” 2019. Web. 08 Aug 2020.

Vancouver:

Edwards C. THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS. [Internet] [Doctoral dissertation]. University of Oklahoma; 2019. [cited 2020 Aug 08]. 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 Minnesota

2. Williams, Nathan Ferd. Cataland.

Degree: PhD, Mathematics, 2013, University of Minnesota

URL: http://purl.umn.edu/159973

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Williams, Nathan Ferd. “Cataland.” 2013. Web. 08 Aug 2020.

Vancouver:

Williams NF. Cataland. [Internet] [Doctoral dissertation]. University of Minnesota; 2013. [cited 2020 Aug 08]. 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 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

URL: http://hdl.handle.net/2142/100954

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Wagner ZA. On some problems in extremal, probabilistic and enumerative combinatorics. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Aug 08]. 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

URL: http://hdl.handle.net/1957/61616

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Morrill, Thomas. “Overpartition Ranks, Cranks, and Frobenius Representations.” 2017. Web. 08 Aug 2020.

Vancouver:

Morrill T. Overpartition Ranks, Cranks, and Frobenius Representations. [Internet] [Doctoral dissertation]. Oregon State University; 2017. [cited 2020 Aug 08]. 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 Waterloo

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

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13601

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Chan, Kelvin Tian Yi. “Induction Relations in the Symmetric Groups and Jucys-Murphy Elements.” 2018. Thesis, University of Waterloo. Accessed August 08, 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 (7^{th} Edition):

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

Vancouver:

Chan KTY. Induction Relations in the Symmetric Groups and Jucys-Murphy Elements. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Aug 08]. 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

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

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

Degree: PhD, Mathematics, 2019, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/61005/

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Scheinerman, Daniel 1. Several problems in linear algebraic and additive combinatorics. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2020 Aug 08]. 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 Melbourne

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

Degree: 2017, University of Melbourne

URL: http://hdl.handle.net/11343/210785

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Foxcroft JSH. Combinatorial enumeration and the Bethe Ansatz. [Internet] [Doctoral dissertation]. University of Melbourne; 2017. [cited 2020 Aug 08]. 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

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

Degree: PhD, Mathematics, 2019, University of Florida

URL: https://ufdc.ufl.edu/UFE0054322

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Copenhaver, Keith J. “Distance Statistics in Rooted Trees.” 2019. Web. 08 Aug 2020.

Vancouver:

Copenhaver KJ. Distance Statistics in Rooted Trees. [Internet] [Doctoral dissertation]. University of Florida; 2019. [cited 2020 Aug 08]. 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 Cambridge

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

Degree: PhD, 2013, University of Cambridge

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

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Przykucki, Michał Jan. “Extremal and probabilistic bootstrap percolation.” 2013. Doctoral Dissertation, University of Cambridge. Accessed August 08, 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 (7^{th} Edition):

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

Vancouver:

Przykucki MJ. Extremal and probabilistic bootstrap percolation. [Internet] [Doctoral dissertation]. University of Cambridge; 2013. [cited 2020 Aug 08]. 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

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

Degree: PhD, 2014, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Weller, Kerstin B. “Connectivity and related properties for graph classes.” 2014. Doctoral Dissertation, University of Oxford. Accessed August 08, 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 (7^{th} Edition):

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

Vancouver:

Weller KB. Connectivity and related properties for graph classes. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2020 Aug 08]. 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

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

Degree: MS, Mathematics, 2015, Oregon State University

URL: http://hdl.handle.net/1957/57952

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Erickson, Sarah A. “Listing as a Potential Connection between Sets of Outcomes and Counting Processes.” 2015. Web. 08 Aug 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 Aug 08]. 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

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

Degree: PhD, 2015, University of Cambridge

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

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

Subjects/Keywords: Combinatorics; Probability theory

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Narayanan, Bhargav. “Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory.” 2015. Doctoral Dissertation, University of Cambridge. Accessed August 08, 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 (7^{th} Edition):

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

Vancouver:

Narayanan B. Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory. [Internet] [Doctoral dissertation]. University of Cambridge; 2015. [cited 2020 Aug 08]. 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

University of Toronto

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

Degree: 2011, University of Toronto

URL: http://hdl.handle.net/1807/31311

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Li X. On the Logarithimic Calculus and Sidorenko's Conjecture. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2020 Aug 08]. 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

University of Waterloo

14. Nelson, Peter. Exponentially Dense Matroids.

Degree: 2011, University of Waterloo

URL: http://hdl.handle.net/10012/6399

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nelson, Peter. “Exponentially Dense Matroids.” 2011. Web. 08 Aug 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Queen Mary, University of London

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

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

URL: http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Pinto TAA. Extremal problems on the hypercube. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2016. [cited 2020 Aug 08]. 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

Colorado State University

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

Degree: PhD, Mathematics, 2015, Colorado State University

URL: http://hdl.handle.net/10217/167107

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Cooper BC. Abstract hyperovals, partial geometries, and transitive hyperovals. [Internet] [Doctoral dissertation]. Colorado State University; 2015. [cited 2020 Aug 08]. 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

University of Cambridge

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

Degree: PhD, 2018, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/273375

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Aug 08]. 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

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

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

URL: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Falgas-Ravry V. Thresholds in probabilistic and extremal combinatorics. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2012. [cited 2020 Aug 08]. 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

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

Degree: PhD, 2017, University of Rochester

URL: http://hdl.handle.net/1802/31885

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Murphy, Brendan; Iosevich A(-). Group actions in arithmetic combinatorics. [Internet] [Doctoral dissertation]. University of Rochester; 2017. [cited 2020 Aug 08]. 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

20.
David, Stefan.
Extremal *combinatorics* and universal algorithms.

Degree: PhD, 2018, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

► 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: Combinatorics; Extremal Combinatorics; Algorithms; Automata theory; Bootstrap percolation; Combinatorics of partially ordered sets

Record Details Similar Records

❌

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

APA (6^{th} Edition):

David, S. (2018). Extremal combinatorics and universal algorithms. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

Chicago Manual of Style (16^{th} Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Doctoral Dissertation, University of Cambridge. Accessed August 08, 2020. https://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

MLA Handbook (7^{th} Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Web. 08 Aug 2020.

Vancouver:

David S. Extremal combinatorics and universal algorithms. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Aug 08]. Available from: https://www.repository.cam.ac.uk/handle/1810/278254 ; 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://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

Dalhousie University

21. Cox, Danielle. On Network Reliability.

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

URL: http://hdl.handle.net/10222/27775

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Cox, Danielle. “On Network Reliability.” 2013. Web. 08 Aug 2020.

Vancouver:

Cox D. On Network Reliability. [Internet] [Doctoral dissertation]. Dalhousie University; 2013. [cited 2020 Aug 08]. 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

Louisiana State University

22. Taylor, Jesse. Selected Problems on Matroid Minors.

Degree: PhD, Applied Mathematics, 2014, Louisiana State University

URL: etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95

► This dissertation begins with an introduction to matroids and graphs. In the first chapter, we develop matroid and graph theory definitions and preliminary results sufficient…
(more)

Subjects/Keywords: graphs; minors; combinatorics; matroids

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Taylor, J. (2014). Selected Problems on Matroid Minors. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95

Chicago Manual of Style (16^{th} Edition):

Taylor, Jesse. “Selected Problems on Matroid Minors.” 2014. Doctoral Dissertation, Louisiana State University. Accessed August 08, 2020. etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95.

MLA Handbook (7^{th} Edition):

Taylor, Jesse. “Selected Problems on Matroid Minors.” 2014. Web. 08 Aug 2020.

Vancouver:

Taylor J. Selected Problems on Matroid Minors. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2020 Aug 08]. Available from: etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95.

Council of Science Editors:

Taylor J. Selected Problems on Matroid Minors. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95

University of California – San Diego

23. Cummings, Jonathan James. Flips and Juggles.

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

URL: http://www.escholarship.org/uc/item/4vn913nb

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cummings, Jonathan James. “Flips and Juggles.” 2016. Web. 08 Aug 2020.

Vancouver:

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

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

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

URL: http://www.escholarship.org/uc/item/7cv95652

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lin, Bo. “Combinatorics and Computations in Tropical Mathematics.” 2017. Web. 08 Aug 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

UCLA

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

Degree: Mathematics, 2015, UCLA

URL: http://www.escholarship.org/uc/item/2zr5v8vb

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Miner, Samuel Alexander. “Limit Shapes of Restricted Permutations.” 2015. Web. 08 Aug 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

UCLA

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

Degree: Mathematics, 2014, UCLA

URL: http://www.escholarship.org/uc/item/6df2p9gk

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Temple University

27. Dobbins, Michael Gene. Representations of Polytopes.

Degree: PhD, 2011, Temple University

URL: http://digital.library.temple.edu/u?/p245801coll10,141523

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Dobbins, Michael Gene. “Representations of Polytopes.” 2011. Web. 08 Aug 2020.

Vancouver:

Dobbins MG. Representations of Polytopes. [Internet] [Doctoral dissertation]. Temple University; 2011. [cited 2020 Aug 08]. 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

Texas A&M University

28. Kostic, Dimitrije Nenad. Graph searching and a generalized parking function.

Degree: 2009, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-1549

► Parking functions have been a focus of mathematical research since the mid-1970s. Various generalizations have been introduced since the mid-1990s and deep relationships between these…
(more)

Subjects/Keywords: combinatorics; parking functions; algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kostic, D. N. (2009). Graph searching and a generalized parking function. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1549

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kostic, Dimitrije Nenad. “Graph searching and a generalized parking function.” 2009. Thesis, Texas A&M University. Accessed August 08, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-1549.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kostic, Dimitrije Nenad. “Graph searching and a generalized parking function.” 2009. Web. 08 Aug 2020.

Vancouver:

Kostic DN. Graph searching and a generalized parking function. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1549.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kostic DN. Graph searching and a generalized parking function. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1549

Not specified: Masters Thesis or Doctoral Dissertation

University of Tasmania

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

Degree: 2016, University of Tasmania

URL: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ham, NC. “The planar modular partition monoid.” 2016. Web. 08 Aug 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Rochester

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

Degree: PhD, 2015, University of Rochester

URL: http://hdl.handle.net/1802/29586

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Bennett MB. Some extremal problems in combinatorial geometry over finite fields. [Internet] [Doctoral dissertation]. University of Rochester; 2015. [cited 2020 Aug 08]. 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