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

[1] [2] [3] [4] [5] [6] [7]

Search Limiters

Last 2 Years | English Only

Universities

Degrees

Levels

Languages

Country

▼ Search Limiters


Rutgers University

1. Braunfeld, Samuel Walker. Infinite limits of finite-dimensional permutation structures, and their automorphism groups: between model theory and combinatorics.

Degree: PhD, Mathematics, 2018, Rutgers University

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders [7], and… (more)

Subjects/Keywords: Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Braunfeld, S. W. (2018). Infinite limits of finite-dimensional permutation structures, and their automorphism groups: between model theory and combinatorics. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/57508/

Chicago Manual of Style (16th Edition):

Braunfeld, Samuel Walker. “Infinite limits of finite-dimensional permutation structures, and their automorphism groups: between model theory and combinatorics.” 2018. Doctoral Dissertation, Rutgers University. Accessed August 08, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/57508/.

MLA Handbook (7th Edition):

Braunfeld, Samuel Walker. “Infinite limits of finite-dimensional permutation structures, and their automorphism groups: between model theory and combinatorics.” 2018. Web. 08 Aug 2020.

Vancouver:

Braunfeld SW. Infinite limits of finite-dimensional permutation structures, and their automorphism groups: between model theory and combinatorics. [Internet] [Doctoral dissertation]. Rutgers University; 2018. [cited 2020 Aug 08]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/57508/.

Council of Science Editors:

Braunfeld SW. Infinite limits of finite-dimensional permutation structures, and their automorphism groups: between model theory and combinatorics. [Doctoral Dissertation]. Rutgers University; 2018. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/57508/


Oregon State University

2. 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 August 08, 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. 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


Hong Kong University of Science and Technology

3. Cheung, Ho Man. The q, t-catalan polynomials and diagonal invariants.

Degree: 2016, Hong Kong University of Science and Technology

 An open problem about proving symmetry phenomenon of q; t-Catalan Polynomial combinatorially, was introduced by James Haglund. Ofir Ammar has suggested a possible generalization related… (more)

Subjects/Keywords: Combinatorial analysis ; Polynomials

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheung, H. M. (2016). The q, t-catalan polynomials and diagonal invariants. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-87107 ; https://doi.org/10.14711/thesis-b1627107 ; http://repository.ust.hk/ir/bitstream/1783.1-87107/1/th_redirect.html

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

Cheung, Ho Man. “The q, t-catalan polynomials and diagonal invariants.” 2016. Thesis, Hong Kong University of Science and Technology. Accessed August 08, 2020. http://repository.ust.hk/ir/Record/1783.1-87107 ; https://doi.org/10.14711/thesis-b1627107 ; http://repository.ust.hk/ir/bitstream/1783.1-87107/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Cheung, Ho Man. “The q, t-catalan polynomials and diagonal invariants.” 2016. Web. 08 Aug 2020.

Vancouver:

Cheung HM. The q, t-catalan polynomials and diagonal invariants. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2016. [cited 2020 Aug 08]. Available from: http://repository.ust.hk/ir/Record/1783.1-87107 ; https://doi.org/10.14711/thesis-b1627107 ; http://repository.ust.hk/ir/bitstream/1783.1-87107/1/th_redirect.html.

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

Council of Science Editors:

Cheung HM. The q, t-catalan polynomials and diagonal invariants. [Thesis]. Hong Kong University of Science and Technology; 2016. Available from: http://repository.ust.hk/ir/Record/1783.1-87107 ; https://doi.org/10.14711/thesis-b1627107 ; http://repository.ust.hk/ir/bitstream/1783.1-87107/1/th_redirect.html

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


Michigan State University

4. Barrese, Kenneth. M-level rook placements.

Degree: 2015, Michigan State University

 Rook theory focuses on placements of non-attacking rooks on boards of various shapes. An important role is played by the rook numbers which count the… (more)

Subjects/Keywords: Combinatorial number theory; Combinatorial analysis; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barrese, K. (2015). M-level rook placements. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:2475

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

Barrese, Kenneth. “M-level rook placements.” 2015. Thesis, Michigan State University. Accessed August 08, 2020. http://etd.lib.msu.edu/islandora/object/etd:2475.

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

MLA Handbook (7th Edition):

Barrese, Kenneth. “M-level rook placements.” 2015. Web. 08 Aug 2020.

Vancouver:

Barrese K. M-level rook placements. [Internet] [Thesis]. Michigan State University; 2015. [cited 2020 Aug 08]. Available from: http://etd.lib.msu.edu/islandora/object/etd:2475.

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

Council of Science Editors:

Barrese K. M-level rook placements. [Thesis]. Michigan State University; 2015. Available from: http://etd.lib.msu.edu/islandora/object/etd:2475

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

5. NC DOCKS at The University of North Carolina at Greensboro; Wyatt, Benjamin J. De bruijn partial words.

Degree: 2013, NC Docks

 In a kn-complex word over an alphabet Σ of size k each of the kn words of length n appear as a subword at least… (more)

Subjects/Keywords: Combinatorial analysis; Mathematical analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

NC DOCKS at The University of North Carolina at Greensboro; Wyatt, B. J. (2013). De bruijn partial words. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/Wyatt_uncg_0154M_11180.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):

NC DOCKS at The University of North Carolina at Greensboro; Wyatt, Benjamin J. “De bruijn partial words.” 2013. Thesis, NC Docks. Accessed August 08, 2020. http://libres.uncg.edu/ir/uncg/f/Wyatt_uncg_0154M_11180.pdf.

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

MLA Handbook (7th Edition):

NC DOCKS at The University of North Carolina at Greensboro; Wyatt, Benjamin J. “De bruijn partial words.” 2013. Web. 08 Aug 2020.

Vancouver:

NC DOCKS at The University of North Carolina at Greensboro; Wyatt BJ. De bruijn partial words. [Internet] [Thesis]. NC Docks; 2013. [cited 2020 Aug 08]. Available from: http://libres.uncg.edu/ir/uncg/f/Wyatt_uncg_0154M_11180.pdf.

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

Council of Science Editors:

NC DOCKS at The University of North Carolina at Greensboro; Wyatt BJ. De bruijn partial words. [Thesis]. NC Docks; 2013. Available from: http://libres.uncg.edu/ir/uncg/f/Wyatt_uncg_0154M_11180.pdf

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


University of Johannesburg

6. Ungerer, Elna. Aspects of signed and minus domination in graphs.

Degree: PhD, 2012, University of Johannesburg

 In Chapter 1 we will give a brief historical account of domination theory and define the necessary concepts which we use in the remainder of… (more)

Subjects/Keywords: Graph theory; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ungerer, E. (2012). Aspects of signed and minus domination in graphs. (Doctoral Dissertation). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6640

Chicago Manual of Style (16th Edition):

Ungerer, Elna. “Aspects of signed and minus domination in graphs.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed August 08, 2020. http://hdl.handle.net/10210/6640.

MLA Handbook (7th Edition):

Ungerer, Elna. “Aspects of signed and minus domination in graphs.” 2012. Web. 08 Aug 2020.

Vancouver:

Ungerer E. Aspects of signed and minus domination in graphs. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10210/6640.

Council of Science Editors:

Ungerer E. Aspects of signed and minus domination in graphs. [Doctoral Dissertation]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6640


University of Johannesburg

7. Dorfling, Samantha. Domination in graphs with bounded degrees.

Degree: 2012, University of Johannesburg

M.Sc.

Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at… (more)

Subjects/Keywords: Graph theory.; Combinatorial analysis.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dorfling, S. (2012). Domination in graphs with bounded degrees. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/7284

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

Dorfling, Samantha. “Domination in graphs with bounded degrees.” 2012. Thesis, University of Johannesburg. Accessed August 08, 2020. http://hdl.handle.net/10210/7284.

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

MLA Handbook (7th Edition):

Dorfling, Samantha. “Domination in graphs with bounded degrees.” 2012. Web. 08 Aug 2020.

Vancouver:

Dorfling S. Domination in graphs with bounded degrees. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10210/7284.

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

Council of Science Editors:

Dorfling S. Domination in graphs with bounded degrees. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/7284

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


Oregon State University

8. Wills, Dean Connable. Connections between combinatorics of permutations and algorithms and geometry.

Degree: PhD, Mathematics, 2009, Oregon State University

 Geometric Problems become increasingly intractable and difficult to visualize as the number of dimensions increases beyond three. Inductions from lower dimensional spaces are possible yet… (more)

Subjects/Keywords: Dihedral Angle; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wills, D. C. (2009). Connections between combinatorics of permutations and algorithms and geometry. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/11929

Chicago Manual of Style (16th Edition):

Wills, Dean Connable. “Connections between combinatorics of permutations and algorithms and geometry.” 2009. Doctoral Dissertation, Oregon State University. Accessed August 08, 2020. http://hdl.handle.net/1957/11929.

MLA Handbook (7th Edition):

Wills, Dean Connable. “Connections between combinatorics of permutations and algorithms and geometry.” 2009. Web. 08 Aug 2020.

Vancouver:

Wills DC. Connections between combinatorics of permutations and algorithms and geometry. [Internet] [Doctoral dissertation]. Oregon State University; 2009. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/1957/11929.

Council of Science Editors:

Wills DC. Connections between combinatorics of permutations and algorithms and geometry. [Doctoral Dissertation]. Oregon State University; 2009. Available from: http://hdl.handle.net/1957/11929

9. Carina Brunehilde Pinto da Silva. Combinatorial analysis: focusing on teaching problem solving.

Degree: Master, 2013, Universidade Federal do Ceará

A AnÃlise CombinatÃria à o conjunto de tÃcnicas para a resoluÃÃo de problemas de contagem. à usada quando à preciso conhecer a quantidade de elementos… (more)

Subjects/Keywords: ANALISE; AnÃlise combinatÃria; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva, C. B. P. d. (2013). Combinatorial analysis: focusing on teaching problem solving. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10084 ;

Chicago Manual of Style (16th Edition):

Silva, Carina Brunehilde Pinto da. “Combinatorial analysis: focusing on teaching problem solving.” 2013. Masters Thesis, Universidade Federal do Ceará. Accessed August 08, 2020. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10084 ;.

MLA Handbook (7th Edition):

Silva, Carina Brunehilde Pinto da. “Combinatorial analysis: focusing on teaching problem solving.” 2013. Web. 08 Aug 2020.

Vancouver:

Silva CBPd. Combinatorial analysis: focusing on teaching problem solving. [Internet] [Masters thesis]. Universidade Federal do Ceará 2013. [cited 2020 Aug 08]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10084 ;.

Council of Science Editors:

Silva CBPd. Combinatorial analysis: focusing on teaching problem solving. [Masters Thesis]. Universidade Federal do Ceará 2013. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10084 ;


Florida State University

10. Brush, Robert Michael. On the Hadamard theorem and maximal determinants in combinatorial investigations.

Degree: 1960, Florida State University

The Hadamard Theorem plays a brief but important role in the study of maximal determinants in chapter II. The proof which is presented follows closely… (more)

Subjects/Keywords: Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brush, R. M. (1960). On the Hadamard theorem and maximal determinants in combinatorial investigations. (Masters Thesis). Florida State University. Retrieved from http://purl.flvc.org/fsu/fd/FSU_historic_AKZ9801 ;

Chicago Manual of Style (16th Edition):

Brush, Robert Michael. “On the Hadamard theorem and maximal determinants in combinatorial investigations.” 1960. Masters Thesis, Florida State University. Accessed August 08, 2020. http://purl.flvc.org/fsu/fd/FSU_historic_AKZ9801 ;.

MLA Handbook (7th Edition):

Brush, Robert Michael. “On the Hadamard theorem and maximal determinants in combinatorial investigations.” 1960. Web. 08 Aug 2020.

Vancouver:

Brush RM. On the Hadamard theorem and maximal determinants in combinatorial investigations. [Internet] [Masters thesis]. Florida State University; 1960. [cited 2020 Aug 08]. Available from: http://purl.flvc.org/fsu/fd/FSU_historic_AKZ9801 ;.

Council of Science Editors:

Brush RM. On the Hadamard theorem and maximal determinants in combinatorial investigations. [Masters Thesis]. Florida State University; 1960. Available from: http://purl.flvc.org/fsu/fd/FSU_historic_AKZ9801 ;


University of Waterloo

11. Graf, Alessandra. Finding Independent Transversals Efficiently.

Degree: 2019, University of Waterloo

 Let G be a graph and (V_1,...,V_m) be a vertex partition of G. An independent transversal (IT) of G with respect to (V_1,...,V_m) is an… (more)

Subjects/Keywords: Combinatorial analysis; Mathematical optimization; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Graf, A. (2019). Finding Independent Transversals Efficiently. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14932

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

Graf, Alessandra. “Finding Independent Transversals Efficiently.” 2019. Thesis, University of Waterloo. Accessed August 08, 2020. http://hdl.handle.net/10012/14932.

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

MLA Handbook (7th Edition):

Graf, Alessandra. “Finding Independent Transversals Efficiently.” 2019. Web. 08 Aug 2020.

Vancouver:

Graf A. Finding Independent Transversals Efficiently. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10012/14932.

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

Council of Science Editors:

Graf A. Finding Independent Transversals Efficiently. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14932

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


University of North Carolina – Greensboro

12. Stajsic, Davorin. Combinatorial Game Theory.

Degree: 2010, University of North Carolina – Greensboro

 Given a combinatorial game, can we determine if there exists a strategy for a player to win the game, and can we pinpoint what this… (more)

Subjects/Keywords: Game theory.; Combinatorial analysis.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stajsic, D. (2010). Combinatorial Game Theory. (Masters Thesis). University of North Carolina – Greensboro. Retrieved from http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=4354

Chicago Manual of Style (16th Edition):

Stajsic, Davorin. “Combinatorial Game Theory.” 2010. Masters Thesis, University of North Carolina – Greensboro. Accessed August 08, 2020. http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=4354.

MLA Handbook (7th Edition):

Stajsic, Davorin. “Combinatorial Game Theory.” 2010. Web. 08 Aug 2020.

Vancouver:

Stajsic D. Combinatorial Game Theory. [Internet] [Masters thesis]. University of North Carolina – Greensboro; 2010. [cited 2020 Aug 08]. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=4354.

Council of Science Editors:

Stajsic D. Combinatorial Game Theory. [Masters Thesis]. University of North Carolina – Greensboro; 2010. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=4354


Rutgers University

13. Herdade, Simao, 1984-. Stability results in additive combinatorics and graph theory.

Degree: PhD, Mathematics, 2015, Rutgers University

A general problem in Extremal Combinatorics asks about the maximum size of a collection of finite objects satisfying certain restrictions, and an ideal solution to… (more)

Subjects/Keywords: Combinatorial analysis; Stability; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Herdade, Simao, 1. (2015). Stability results in additive combinatorics and graph theory. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/47413/

Chicago Manual of Style (16th Edition):

Herdade, Simao, 1984-. “Stability results in additive combinatorics and graph theory.” 2015. Doctoral Dissertation, Rutgers University. Accessed August 08, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/47413/.

MLA Handbook (7th Edition):

Herdade, Simao, 1984-. “Stability results in additive combinatorics and graph theory.” 2015. Web. 08 Aug 2020.

Vancouver:

Herdade, Simao 1. Stability results in additive combinatorics and graph theory. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Aug 08]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47413/.

Council of Science Editors:

Herdade, Simao 1. Stability results in additive combinatorics and graph theory. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47413/


Rutgers University

14. Ilinca, Liviu, 1980-. Asymptotic enumeration of 2- and 3-SAT functions.

Degree: PhD, Mathematics, 2010, Rutgers University

We are interested in the number, G(k,n), of Boolean functions of n variables definable by k-SAT formulae. First, in Chapter 2, we give an alternate… (more)

Subjects/Keywords: Combinatorial analysis; Graph theory; Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ilinca, Liviu, 1. (2010). Asymptotic enumeration of 2- and 3-SAT functions. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609

Chicago Manual of Style (16th Edition):

Ilinca, Liviu, 1980-. “Asymptotic enumeration of 2- and 3-SAT functions.” 2010. Doctoral Dissertation, Rutgers University. Accessed August 08, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609.

MLA Handbook (7th Edition):

Ilinca, Liviu, 1980-. “Asymptotic enumeration of 2- and 3-SAT functions.” 2010. Web. 08 Aug 2020.

Vancouver:

Ilinca, Liviu 1. Asymptotic enumeration of 2- and 3-SAT functions. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Aug 08]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609.

Council of Science Editors:

Ilinca, Liviu 1. Asymptotic enumeration of 2- and 3-SAT functions. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609


Florida Atlantic University

15. Khadka, Bal K. Techniques in Lattice Basis Reduction.

Degree: 2016, Florida Atlantic University

Summary: The mathematical theory of nding a basis of shortest possible vectors in a given lattice L is known as reduction theory and goes back… (more)

Subjects/Keywords: Cryptography.; Combinatorial analysis.; Group theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khadka, B. K. (2016). Techniques in Lattice Basis Reduction. (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004678

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

Khadka, Bal K. “Techniques in Lattice Basis Reduction.” 2016. Thesis, Florida Atlantic University. Accessed August 08, 2020. http://purl.flvc.org/fau/fd/FA00004678.

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

MLA Handbook (7th Edition):

Khadka, Bal K. “Techniques in Lattice Basis Reduction.” 2016. Web. 08 Aug 2020.

Vancouver:

Khadka BK. Techniques in Lattice Basis Reduction. [Internet] [Thesis]. Florida Atlantic University; 2016. [cited 2020 Aug 08]. Available from: http://purl.flvc.org/fau/fd/FA00004678.

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

Council of Science Editors:

Khadka BK. Techniques in Lattice Basis Reduction. [Thesis]. Florida Atlantic University; 2016. Available from: http://purl.flvc.org/fau/fd/FA00004678

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


University of Technology, Sydney

16. Sutcliffe, PJ. Moments over the solution space of the travelling salesman problem.

Degree: 2009, University of Technology, Sydney

 In this thesis we consider the statistical properties of the symmetric travelling salesman problem (TSP). Previous work on the statistical properties of the problem has… (more)

Subjects/Keywords: Combinatorial analysis.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sutcliffe, P. (2009). Moments over the solution space of the travelling salesman problem. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/20302

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

Sutcliffe, PJ. “Moments over the solution space of the travelling salesman problem.” 2009. Thesis, University of Technology, Sydney. Accessed August 08, 2020. http://hdl.handle.net/10453/20302.

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

MLA Handbook (7th Edition):

Sutcliffe, PJ. “Moments over the solution space of the travelling salesman problem.” 2009. Web. 08 Aug 2020.

Vancouver:

Sutcliffe P. Moments over the solution space of the travelling salesman problem. [Internet] [Thesis]. University of Technology, Sydney; 2009. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10453/20302.

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

Council of Science Editors:

Sutcliffe P. Moments over the solution space of the travelling salesman problem. [Thesis]. University of Technology, Sydney; 2009. Available from: http://hdl.handle.net/10453/20302

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

17. Corley, Christopher M. On the minimum rank of certain graphs with path cover number 2.

Degree: 2015, University of Tennessee – Chattanooga

 The minimum rank problem is an interesting and ongoing problem in spectral graph theory which seeks to answer the question "Given a simple graph G… (more)

Subjects/Keywords: Graph theory (Mathematics); Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Corley, C. M. (2015). On the minimum rank of certain graphs with path cover number 2. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/166

Chicago Manual of Style (16th Edition):

Corley, Christopher M. “On the minimum rank of certain graphs with path cover number 2.” 2015. Masters Thesis, University of Tennessee – Chattanooga. Accessed August 08, 2020. https://scholar.utc.edu/theses/166.

MLA Handbook (7th Edition):

Corley, Christopher M. “On the minimum rank of certain graphs with path cover number 2.” 2015. Web. 08 Aug 2020.

Vancouver:

Corley CM. On the minimum rank of certain graphs with path cover number 2. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2015. [cited 2020 Aug 08]. Available from: https://scholar.utc.edu/theses/166.

Council of Science Editors:

Corley CM. On the minimum rank of certain graphs with path cover number 2. [Masters Thesis]. University of Tennessee – Chattanooga; 2015. Available from: https://scholar.utc.edu/theses/166

18. Basit, Abdul, 1987-. Some applications of algebraic methods in combinatorial geometry.

Degree: PhD, Computer Science, 2017, Rutgers University

This dissertation explores problems in combinatorial geometry relating to incidences and to applications of incidence problems in other areas of combinatorics. In recent years, various… (more)

Subjects/Keywords: Combinatorial geometry; Combinatorial analysis

…1 Chapter 1 Introduction Combinatorial Geometry is a field bringing together ideas from… …involves studying the combinatorial properties of such arrangements. Problems in the area involve… …an important subfield of combinatorial geometry, referred to as incidence geometry… …arithmetic combinatorics (e.g., see [31, 20]), combinatorial geometry (e.g… …see [39, 44, 63]) and harmonic analysis (e.g., see [76])… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Basit, Abdul, 1. (2017). Some applications of algebraic methods in combinatorial geometry. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/54176/

Chicago Manual of Style (16th Edition):

Basit, Abdul, 1987-. “Some applications of algebraic methods in combinatorial geometry.” 2017. Doctoral Dissertation, Rutgers University. Accessed August 08, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/54176/.

MLA Handbook (7th Edition):

Basit, Abdul, 1987-. “Some applications of algebraic methods in combinatorial geometry.” 2017. Web. 08 Aug 2020.

Vancouver:

Basit, Abdul 1. Some applications of algebraic methods in combinatorial geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Aug 08]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/.

Council of Science Editors:

Basit, Abdul 1. Some applications of algebraic methods in combinatorial geometry. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/


University of British Columbia

19. Wang, Yaoguang. Polyhedral studies on scheduling and routing problems .

Degree: 1991, University of British Columbia

 During the last decade, there have been major advances in solving a class of large-scale real world combinatorial optimization problems. Such problems are formulated as… (more)

Subjects/Keywords: Combinatorial optimization; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (1991). Polyhedral studies on scheduling and routing problems . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/32385

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

Wang, Yaoguang. “Polyhedral studies on scheduling and routing problems .” 1991. Thesis, University of British Columbia. Accessed August 08, 2020. http://hdl.handle.net/2429/32385.

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

MLA Handbook (7th Edition):

Wang, Yaoguang. “Polyhedral studies on scheduling and routing problems .” 1991. Web. 08 Aug 2020.

Vancouver:

Wang Y. Polyhedral studies on scheduling and routing problems . [Internet] [Thesis]. University of British Columbia; 1991. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2429/32385.

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

Council of Science Editors:

Wang Y. Polyhedral studies on scheduling and routing problems . [Thesis]. University of British Columbia; 1991. Available from: http://hdl.handle.net/2429/32385

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


Ryerson University

20. Krikorian, Tamar. Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays.

Degree: 2011, Ryerson University

 In this thesis, we consider combinatorial objects called ordered orthogonal arrays, which are related to orthogonal arrays and Latin squares. We also introduce a new… (more)

Subjects/Keywords: Orthogonal arrays; Combinatorial analysis; Magic squares

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krikorian, T. (2011). Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A2483

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

Krikorian, Tamar. “Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays.” 2011. Thesis, Ryerson University. Accessed August 08, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A2483.

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

MLA Handbook (7th Edition):

Krikorian, Tamar. “Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays.” 2011. Web. 08 Aug 2020.

Vancouver:

Krikorian T. Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays. [Internet] [Thesis]. Ryerson University; 2011. [cited 2020 Aug 08]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2483.

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

Council of Science Editors:

Krikorian T. Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays. [Thesis]. Ryerson University; 2011. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2483

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


Ryerson University

21. Dennis, Christopher. Error locating: degree constraints.

Degree: 2016, Ryerson University

 Error graphs are a useful mathematical tool for representing failing interactions in a system. This representation is used as the basis for constructing an error… (more)

Subjects/Keywords: Array processors.; Graph theory.; Combinatorial analysis.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dennis, C. (2016). Error locating: degree constraints. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A5690

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

Dennis, Christopher. “Error locating: degree constraints.” 2016. Thesis, Ryerson University. Accessed August 08, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A5690.

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

MLA Handbook (7th Edition):

Dennis, Christopher. “Error locating: degree constraints.” 2016. Web. 08 Aug 2020.

Vancouver:

Dennis C. Error locating: degree constraints. [Internet] [Thesis]. Ryerson University; 2016. [cited 2020 Aug 08]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A5690.

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

Council of Science Editors:

Dennis C. Error locating: degree constraints. [Thesis]. Ryerson University; 2016. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A5690

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


Massey University

22. Liu, Tong. Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University .

Degree: 2020, Massey University

 K-means clustering algorithm is designed to divide the samples into subsets with the goal that maximizes the intra-subset similarity and inter-subset dissimilarity where the similarity… (more)

Subjects/Keywords: Cluster analysis; Computer algorithms; Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, T. (2020). Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University . (Thesis). Massey University. Retrieved from http://hdl.handle.net/10179/15384

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

Liu, Tong. “Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University .” 2020. Thesis, Massey University. Accessed August 08, 2020. http://hdl.handle.net/10179/15384.

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

MLA Handbook (7th Edition):

Liu, Tong. “Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University .” 2020. Web. 08 Aug 2020.

Vancouver:

Liu T. Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University . [Internet] [Thesis]. Massey University; 2020. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10179/15384.

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

Council of Science Editors:

Liu T. Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University . [Thesis]. Massey University; 2020. Available from: http://hdl.handle.net/10179/15384

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

23. McDevitt, Matthew. Orderings on words and permutations.

Degree: PhD, 2019, University of St Andrews

 Substructure orderings are ubiquitous throughout combinatorics and all of mathematics. In this thesis we consider various orderings on words, as well as the consecutive involvement… (more)

Subjects/Keywords: QA171.48M3; Ordered sets; Combinatorial analysis; Permutations

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McDevitt, M. (2019). Orderings on words and permutations. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/18465

Chicago Manual of Style (16th Edition):

McDevitt, Matthew. “Orderings on words and permutations.” 2019. Doctoral Dissertation, University of St Andrews. Accessed August 08, 2020. http://hdl.handle.net/10023/18465.

MLA Handbook (7th Edition):

McDevitt, Matthew. “Orderings on words and permutations.” 2019. Web. 08 Aug 2020.

Vancouver:

McDevitt M. Orderings on words and permutations. [Internet] [Doctoral dissertation]. University of St Andrews; 2019. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10023/18465.

Council of Science Editors:

McDevitt M. Orderings on words and permutations. [Doctoral Dissertation]. University of St Andrews; 2019. Available from: http://hdl.handle.net/10023/18465


Rutgers University

24. Wood, Philip J. On the probability that a discrete complex random matrix is singular:.

Degree: PhD, Mathematics, 2009, Rutgers University

Let n be a large integer and M_n be an n by n complex matrix whose entries are independent (but not necessarily identically distributed) discrete random variables. The main goal of this thesis is to prove a general upper bound for the probability that M_n is singular. For a constant 0 < p < 1 and a constant positive integer r, we will define a property p-bounded of exponent r. Our main result shows that if the entries of M_n satisfy this property, then the probability that M_n is singular is at most (p^(1/r) + o(1) )^n. All of the results in this thesis hold for any characteristic zero integral domain replacing the complex numbers. In the special case where the entries of M_n are "fair coin flips" (taking the values +1, -1 each with probability 1/2), our general bound implies that the probability that Mn is singular is at most (1/[square root]2 + o(1))^n, improving on the previous best upper bound of (3/4 + o(1))^n, proved by Tao and Vu in 2007. In the special case where the entries of M_n are "lazy coin flips" (taking values +1, -1 each with probability 1/4 and value 0 with probability 1/2), our general bound implies that the probability that M_n is singular is at most (1/2 + o(1))^n, which is asymptotically sharp. Our method is a refinement of those from Kahn, Komlos, and Szemeredi in 1995 and Tao and Vu in 2007. In particular, we make a critical use of the Structure Theorem from Tao and Vu in 2007, which was obtained using tools from additive combinatorics. One key lemma for extending our results to the complex numbers follows from a more general result about characteristic zero integral domains. We show that any finite system S in a characteristic zero integral domain can be mapped to Z/QZ, for infinitely many primes Q, preserving all algebraic incidences in S . This can be seen as a generalization of the well-known Freiman isomorphism lemma, which asserts that any finite subset of a torsion-free group can be mapped into Z/QZ, preserving all linear incidences. As applications, we derive several combinatorial results (such as sum-product estimates) for a finite set in a characteristic zero integral domain. As C is a characteristic zero integral domain, this allows us to obtain new proofs for some recent results concerning finite sets of complex numbers, without relying on the topology of the plane.

Advisors/Committee Members: Wood, Philip J. (author), Vu, Van (chair), Kahn, Jeff (internal member), Komlos, Janos (internal member), Frieze, Alan (outside member).

Subjects/Keywords: Matrices; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wood, P. J. (2009). On the probability that a discrete complex random matrix is singular:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051423

Chicago Manual of Style (16th Edition):

Wood, Philip J. “On the probability that a discrete complex random matrix is singular:.” 2009. Doctoral Dissertation, Rutgers University. Accessed August 08, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051423.

MLA Handbook (7th Edition):

Wood, Philip J. “On the probability that a discrete complex random matrix is singular:.” 2009. Web. 08 Aug 2020.

Vancouver:

Wood PJ. On the probability that a discrete complex random matrix is singular:. [Internet] [Doctoral dissertation]. Rutgers University; 2009. [cited 2020 Aug 08]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051423.

Council of Science Editors:

Wood PJ. On the probability that a discrete complex random matrix is singular:. [Doctoral Dissertation]. Rutgers University; 2009. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051423


Rutgers University

25. Gilmer, Justin, 1986-. Discrete local central limit theorems and boolean function complexity measures.

Degree: PhD, Mathematics, 2015, Rutgers University

This thesis consists of 6 chapters (the first being an introduction). Two chapters relate to local central limit theorems, and three chapters relate to various… (more)

Subjects/Keywords: Central limit theorem; Algebra, Boolean; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gilmer, Justin, 1. (2015). Discrete local central limit theorems and boolean function complexity measures. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46347/

Chicago Manual of Style (16th Edition):

Gilmer, Justin, 1986-. “Discrete local central limit theorems and boolean function complexity measures.” 2015. Doctoral Dissertation, Rutgers University. Accessed August 08, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/46347/.

MLA Handbook (7th Edition):

Gilmer, Justin, 1986-. “Discrete local central limit theorems and boolean function complexity measures.” 2015. Web. 08 Aug 2020.

Vancouver:

Gilmer, Justin 1. Discrete local central limit theorems and boolean function complexity measures. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Aug 08]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/.

Council of Science Editors:

Gilmer, Justin 1. Discrete local central limit theorems and boolean function complexity measures. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/

26. Berkowitz, Ross. A few combinatorial problems.

Degree: PhD, Mathematics, 2017, Rutgers University

This thesis studies three problems in combinatorics. Our first result is a quantitative local limit theorem for the distribution of the number of triangles in… (more)

Subjects/Keywords: Combinatorial analysis

…among other tools, probability theory, Fourier analysis, and the properties of low degree… …count. The ingredients of the proof involve a careful analysis of the Fourier transform of the… …analysis of their structure, Gray codes, and concatenation. Additionally, the sequence has a… …particular, they are essentially codewords of C). We do this using a Gray code. The analysis… …the dependence on n and p, as we will be considering p to be fixed and our analysis will be… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Berkowitz, R. (2017). A few combinatorial problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/54177/

Chicago Manual of Style (16th Edition):

Berkowitz, Ross. “A few combinatorial problems.” 2017. Doctoral Dissertation, Rutgers University. Accessed August 08, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/54177/.

MLA Handbook (7th Edition):

Berkowitz, Ross. “A few combinatorial problems.” 2017. Web. 08 Aug 2020.

Vancouver:

Berkowitz R. A few combinatorial problems. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Aug 08]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54177/.

Council of Science Editors:

Berkowitz R. A few combinatorial problems. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54177/


Michigan State University

27. Dahlberg, Samantha. Patterns in set partitions and restricted growth functions.

Degree: 2016, Michigan State University

Thesis Ph. D. Michigan State University. Mathematics 2016

In this thesis we study two related notions of pattern avoidance.One is in set partitions σ of… (more)

Subjects/Keywords: Partitions (Mathematics); Generating functions; Combinatorial analysis; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dahlberg, S. (2016). Patterns in set partitions and restricted growth functions. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:3816

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

Dahlberg, Samantha. “Patterns in set partitions and restricted growth functions.” 2016. Thesis, Michigan State University. Accessed August 08, 2020. http://etd.lib.msu.edu/islandora/object/etd:3816.

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

MLA Handbook (7th Edition):

Dahlberg, Samantha. “Patterns in set partitions and restricted growth functions.” 2016. Web. 08 Aug 2020.

Vancouver:

Dahlberg S. Patterns in set partitions and restricted growth functions. [Internet] [Thesis]. Michigan State University; 2016. [cited 2020 Aug 08]. Available from: http://etd.lib.msu.edu/islandora/object/etd:3816.

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

Council of Science Editors:

Dahlberg S. Patterns in set partitions and restricted growth functions. [Thesis]. Michigan State University; 2016. Available from: http://etd.lib.msu.edu/islandora/object/etd:3816

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


University of Hong Kong

28. Chan, Yip-cheung. Minimal rank of abelian group matrices.

Degree: 1996, University of Hong Kong

Subjects/Keywords: Combinatorial analysis.; Matrices.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chan, Y. (1996). Minimal rank of abelian group matrices. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/31672

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, Yip-cheung. “Minimal rank of abelian group matrices.” 1996. Thesis, University of Hong Kong. Accessed August 08, 2020. http://hdl.handle.net/10722/31672.

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

MLA Handbook (7th Edition):

Chan, Yip-cheung. “Minimal rank of abelian group matrices.” 1996. Web. 08 Aug 2020.

Vancouver:

Chan Y. Minimal rank of abelian group matrices. [Internet] [Thesis]. University of Hong Kong; 1996. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10722/31672.

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

Council of Science Editors:

Chan Y. Minimal rank of abelian group matrices. [Thesis]. University of Hong Kong; 1996. Available from: http://hdl.handle.net/10722/31672

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


Drexel University

29. Shields, Patrick Robert. Inflated Weight, a Dual Approach to Structure Constants for K-Theory of Grassmannians, and a Charge Statistic for Shifted Tableaux.

Degree: 2018, Drexel University

The problem of computing products of Schubert classes in the cohomology ring can be formulated as the problem of expanding skew Schur polynomials into the… (more)

Subjects/Keywords: Mathematics; Combinatorial analysis; Grassmann manifolds; K-theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shields, P. R. (2018). Inflated Weight, a Dual Approach to Structure Constants for K-Theory of Grassmannians, and a Charge Statistic for Shifted Tableaux. (Thesis). Drexel University. Retrieved from https://idea.library.drexel.edu/islandora/object/idea%3A8276

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

Shields, Patrick Robert. “Inflated Weight, a Dual Approach to Structure Constants for K-Theory of Grassmannians, and a Charge Statistic for Shifted Tableaux.” 2018. Thesis, Drexel University. Accessed August 08, 2020. https://idea.library.drexel.edu/islandora/object/idea%3A8276.

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

MLA Handbook (7th Edition):

Shields, Patrick Robert. “Inflated Weight, a Dual Approach to Structure Constants for K-Theory of Grassmannians, and a Charge Statistic for Shifted Tableaux.” 2018. Web. 08 Aug 2020.

Vancouver:

Shields PR. Inflated Weight, a Dual Approach to Structure Constants for K-Theory of Grassmannians, and a Charge Statistic for Shifted Tableaux. [Internet] [Thesis]. Drexel University; 2018. [cited 2020 Aug 08]. Available from: https://idea.library.drexel.edu/islandora/object/idea%3A8276.

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

Council of Science Editors:

Shields PR. Inflated Weight, a Dual Approach to Structure Constants for K-Theory of Grassmannians, and a Charge Statistic for Shifted Tableaux. [Thesis]. Drexel University; 2018. Available from: https://idea.library.drexel.edu/islandora/object/idea%3A8276

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


University of Hong Kong

30. Yu, Junjie. Phylogenetic tree reconstruction with protein linkage.

Degree: 2012, University of Hong Kong

 Phylogenetic tree reconstruction for a set of species is an important problem for understanding the evolutionary history of the species. Existing algorithms usually represent each… (more)

Subjects/Keywords: Phylogeny.; Combinatorial analysis.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, J. (2012). Phylogenetic tree reconstruction with protein linkage. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/181488

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

Yu, Junjie. “Phylogenetic tree reconstruction with protein linkage.” 2012. Thesis, University of Hong Kong. Accessed August 08, 2020. http://hdl.handle.net/10722/181488.

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

MLA Handbook (7th Edition):

Yu, Junjie. “Phylogenetic tree reconstruction with protein linkage.” 2012. Web. 08 Aug 2020.

Vancouver:

Yu J. Phylogenetic tree reconstruction with protein linkage. [Internet] [Thesis]. University of Hong Kong; 2012. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10722/181488.

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

Council of Science Editors:

Yu J. Phylogenetic tree reconstruction with protein linkage. [Thesis]. University of Hong Kong; 2012. Available from: http://hdl.handle.net/10722/181488

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

[1] [2] [3] [4] [5] [6] [7]

.