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:(Dyck paths). Showing records 1 – 9 of 9 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Queen Mary, University of London

1. Mortimer, Paul. Lattice path enumeration on restricted domains.

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

 This thesis concerns the enumeration and structural properties of lattice paths. The study of Dyck paths and their characteristics is a classical combinatorial subject. In… (more)

Subjects/Keywords: Mathematics; Dyck paths; algebraic combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mortimer, P. (2016). Lattice path enumeration on restricted domains. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/12992 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.775258

Chicago Manual of Style (16th Edition):

Mortimer, Paul. “Lattice path enumeration on restricted domains.” 2016. Doctoral Dissertation, Queen Mary, University of London. Accessed January 15, 2021. http://qmro.qmul.ac.uk/xmlui/handle/123456789/12992 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.775258.

MLA Handbook (7th Edition):

Mortimer, Paul. “Lattice path enumeration on restricted domains.” 2016. Web. 15 Jan 2021.

Vancouver:

Mortimer P. Lattice path enumeration on restricted domains. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2016. [cited 2021 Jan 15]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/12992 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.775258.

Council of Science Editors:

Mortimer P. Lattice path enumeration on restricted domains. [Doctoral Dissertation]. Queen Mary, University of London; 2016. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/12992 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.775258

2. Manes, Konstantinos. Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck.

Degree: 2014, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς

The Catalan numbers are considered to be the second most significant numbers in Combinatorics, after the binomial coefficients, because they appear frequently in various combinatorial… (more)

Subjects/Keywords: Μονοπάτια Dyck; Μονοπάτια Grand-Dyck; Αριθμοί Catalan; ΓΕΝΝΗΤΡΙΕΣ ΣΥΝΑΡΤΗΣΕΙΣ; Συνδυαστική απαρίθμηση; Τύπος αντιστροφής Lagrange; Dyck paths; Grand-Dyck paths; Catalan numbers; GENERATING FUNCTIONS; Combinatorial enumeration; Lagrange inversion formula

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manes, K. (2014). Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck. (Thesis). University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Retrieved from http://hdl.handle.net/10442/hedi/34603

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

Manes, Konstantinos. “Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck.” 2014. Thesis, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Accessed January 15, 2021. http://hdl.handle.net/10442/hedi/34603.

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

MLA Handbook (7th Edition):

Manes, Konstantinos. “Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck.” 2014. Web. 15 Jan 2021.

Vancouver:

Manes K. Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck. [Internet] [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2014. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10442/hedi/34603.

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

Council of Science Editors:

Manes K. Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck. [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2014. Available from: http://hdl.handle.net/10442/hedi/34603

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


Stellenbosch University

3. Selkirk, Sarah Jane. On a generalisation of k-Dyck paths.

Degree: MSc, Mathematical Sciences, 2019, Stellenbosch University

ENGLISH ABSTRACT: (Refer to full text abstract for symbols that did not transfer correctly). We consider a family of non-negative lattice paths consisting of the… (more)

Subjects/Keywords: Combinatorial analysis; Lattice paths; Combinational enumeration problems; Dyck paths; Catalan numbers (Mathematics); UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Selkirk, S. J. (2019). On a generalisation of k-Dyck paths. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/107091

Chicago Manual of Style (16th Edition):

Selkirk, Sarah Jane. “On a generalisation of k-Dyck paths.” 2019. Masters Thesis, Stellenbosch University. Accessed January 15, 2021. http://hdl.handle.net/10019.1/107091.

MLA Handbook (7th Edition):

Selkirk, Sarah Jane. “On a generalisation of k-Dyck paths.” 2019. Web. 15 Jan 2021.

Vancouver:

Selkirk SJ. On a generalisation of k-Dyck paths. [Internet] [Masters thesis]. Stellenbosch University; 2019. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10019.1/107091.

Council of Science Editors:

Selkirk SJ. On a generalisation of k-Dyck paths. [Masters Thesis]. Stellenbosch University; 2019. Available from: http://hdl.handle.net/10019.1/107091


Carnegie Mellon University

4. Allen, Emily. Combinatorial Interpretations Of Generalizations Of Catalan Numbers And Ballot Numbers.

Degree: 2014, Carnegie Mellon University

 The super Catalan numbers T(m,n) = (2m)!(2n)!=2m!n!(m+n)! are integers which generalize the Catalan numbers. Since 1874, when Eugene Catalan discovered these numbers, many mathematicians have… (more)

Subjects/Keywords: combinatorics; lattice paths; Dyck path; Catalan numbers; Ballot numbers; super Catalan numbers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Allen, E. (2014). Combinatorial Interpretations Of Generalizations Of Catalan Numbers And Ballot Numbers. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/366

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

Allen, Emily. “Combinatorial Interpretations Of Generalizations Of Catalan Numbers And Ballot Numbers.” 2014. Thesis, Carnegie Mellon University. Accessed January 15, 2021. http://repository.cmu.edu/dissertations/366.

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

MLA Handbook (7th Edition):

Allen, Emily. “Combinatorial Interpretations Of Generalizations Of Catalan Numbers And Ballot Numbers.” 2014. Web. 15 Jan 2021.

Vancouver:

Allen E. Combinatorial Interpretations Of Generalizations Of Catalan Numbers And Ballot Numbers. [Internet] [Thesis]. Carnegie Mellon University; 2014. [cited 2021 Jan 15]. Available from: http://repository.cmu.edu/dissertations/366.

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

Council of Science Editors:

Allen E. Combinatorial Interpretations Of Generalizations Of Catalan Numbers And Ballot Numbers. [Thesis]. Carnegie Mellon University; 2014. Available from: http://repository.cmu.edu/dissertations/366

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


University of California – San Diego

5. Qiu, Dun. Combinatorics in the Rational Shuffle Theorem and the Delta Conjecture.

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

 The Classical Shuffle Conjecture proposed by Haglund, Haiman, Loehr, Remmel and Ulyanov gives a well-studied combinatorial expression for the bigraded Frobenius characteristic of Sn-module of… (more)

Subjects/Keywords: Mathematics; Catalan numbers; Dyck paths; Macdonald polynomials; ordered set partitions; parking functions; symmetric functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qiu, D. (2019). Combinatorics in the Rational Shuffle Theorem and the Delta Conjecture. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/07v3n1wj

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

Qiu, Dun. “Combinatorics in the Rational Shuffle Theorem and the Delta Conjecture.” 2019. Thesis, University of California – San Diego. Accessed January 15, 2021. http://www.escholarship.org/uc/item/07v3n1wj.

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

MLA Handbook (7th Edition):

Qiu, Dun. “Combinatorics in the Rational Shuffle Theorem and the Delta Conjecture.” 2019. Web. 15 Jan 2021.

Vancouver:

Qiu D. Combinatorics in the Rational Shuffle Theorem and the Delta Conjecture. [Internet] [Thesis]. University of California – San Diego; 2019. [cited 2021 Jan 15]. Available from: http://www.escholarship.org/uc/item/07v3n1wj.

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

Council of Science Editors:

Qiu D. Combinatorics in the Rational Shuffle Theorem and the Delta Conjecture. [Thesis]. University of California – San Diego; 2019. Available from: http://www.escholarship.org/uc/item/07v3n1wj

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


University of Arizona

6. McNicholas, Erin Mari. Embedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Maps .

Degree: 2006, University of Arizona

 Using numerical simulations and combinatorics, this dissertation focuses on connections between random matrix theory and graph theory.We examine the adjacency matrices of three-regular graphs representing… (more)

Subjects/Keywords: planar trees; Dyck paths; eigenvalue statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McNicholas, E. M. (2006). Embedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Maps . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/194030

Chicago Manual of Style (16th Edition):

McNicholas, Erin Mari. “Embedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Maps .” 2006. Doctoral Dissertation, University of Arizona. Accessed January 15, 2021. http://hdl.handle.net/10150/194030.

MLA Handbook (7th Edition):

McNicholas, Erin Mari. “Embedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Maps .” 2006. Web. 15 Jan 2021.

Vancouver:

McNicholas EM. Embedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Maps . [Internet] [Doctoral dissertation]. University of Arizona; 2006. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10150/194030.

Council of Science Editors:

McNicholas EM. Embedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Maps . [Doctoral Dissertation]. University of Arizona; 2006. Available from: http://hdl.handle.net/10150/194030


University of Vienna

7. Stump, Christian. q,t-Fuß-Catalan numbers for finite reflection groups.

Degree: 2008, University of Vienna

Im Typ A können die q,t-Catalan Zahlen und die q,t-Fuß-Catalan Zahlen als bigraduierte Hilbertreihe einesModuls über der symmetrischen Gruppe definiert werden. Wir verallgemeinern diese Konstruktion… (more)

Subjects/Keywords: 31.12 Kombinatorik, Graphentheorie; 31.23 Ideale, Ringe, Moduln, Algebren; Catalan Zahlen / Dyck-Pfade / Spiegelungsgruppen / nicht-kreuzende Partitionen / Coxeter-sortierbare Elemente / nicht-schachtelnde Partitionen / Shi-Gefüge; Catalan numbers / Dyck paths / reflection groups / non-crossing partitions / Coxeter sortable elements / non-nesting partitions / Shi arrangement

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stump, C. (2008). q,t-Fuß-Catalan numbers for finite reflection groups. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/1091/

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

Stump, Christian. “q,t-Fuß-Catalan numbers for finite reflection groups.” 2008. Thesis, University of Vienna. Accessed January 15, 2021. http://othes.univie.ac.at/1091/.

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

MLA Handbook (7th Edition):

Stump, Christian. “q,t-Fuß-Catalan numbers for finite reflection groups.” 2008. Web. 15 Jan 2021.

Vancouver:

Stump C. q,t-Fuß-Catalan numbers for finite reflection groups. [Internet] [Thesis]. University of Vienna; 2008. [cited 2021 Jan 15]. Available from: http://othes.univie.ac.at/1091/.

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

Council of Science Editors:

Stump C. q,t-Fuß-Catalan numbers for finite reflection groups. [Thesis]. University of Vienna; 2008. Available from: http://othes.univie.ac.at/1091/

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


Universitat Politècnica de Catalunya

8. Elizalde Torrent, Sergi. Consecutive patterns and statistics on restricted permutations.

Degree: 2004, Universitat Politècnica de Catalunya

 El tema d'aquesta tesi és l'enumeració de permutacions amb subseqüències prohibides respecte a certs estadístics, i l'enumeració de permutacions que eviten subseqüències generalitzades. Després d'introduir… (more)

Subjects/Keywords: consecutive patterns; tunnel; statistics; dyck paths; pattern avoidance; permutations; bijection; generalized patterns; restricted permutation; 1202. Anàlisi i anàlisi funcional - 1209. Estadística - 1201. Algebra - 1299. Altres especialitats m; 519.1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Elizalde Torrent, S. (2004). Consecutive patterns and statistics on restricted permutations. (Thesis). Universitat Politècnica de Catalunya. Retrieved from http://hdl.handle.net/10803/5839

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

Elizalde Torrent, Sergi. “Consecutive patterns and statistics on restricted permutations.” 2004. Thesis, Universitat Politècnica de Catalunya. Accessed January 15, 2021. http://hdl.handle.net/10803/5839.

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

MLA Handbook (7th Edition):

Elizalde Torrent, Sergi. “Consecutive patterns and statistics on restricted permutations.” 2004. Web. 15 Jan 2021.

Vancouver:

Elizalde Torrent S. Consecutive patterns and statistics on restricted permutations. [Internet] [Thesis]. Universitat Politècnica de Catalunya; 2004. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10803/5839.

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

Council of Science Editors:

Elizalde Torrent S. Consecutive patterns and statistics on restricted permutations. [Thesis]. Universitat Politècnica de Catalunya; 2004. Available from: http://hdl.handle.net/10803/5839

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


University of Victoria

9. Williams, Aaron Michael. Shift gray codes.

Degree: Dept. of Computer Science, 2009, University of Victoria

 Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding… (more)

Subjects/Keywords: shorthand universal cycles; combinatorial generation; minimal-change order; loopless algorithm; efficient algorithm; combinations; multiset permutations; balanced parentheses; Dyck words; Catalan paths; Schroder paths; Motzkin words; linear-extensions; posets; connected unit interval graphs; inversions; binary trees; k-ary trees; ordered trees with fixed branching sequence; Lyndon words; pre-necklaces; theoretical computer science; discrete mathematics; combinatorics; brute forcs; de Bruijn cycles; bubble languages; cool-lex order; lexicographic order; combinatorial enumeration; stacker-crane problem; traveling salesman problem; middle levels; fixed-density de Bruijn cycle; fixed-content; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science; UVic Subject Index::Sciences and Engineering::Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Williams, A. M. (2009). Shift gray codes. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1966

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

Williams, Aaron Michael. “Shift gray codes.” 2009. Thesis, University of Victoria. Accessed January 15, 2021. http://hdl.handle.net/1828/1966.

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

MLA Handbook (7th Edition):

Williams, Aaron Michael. “Shift gray codes.” 2009. Web. 15 Jan 2021.

Vancouver:

Williams AM. Shift gray codes. [Internet] [Thesis]. University of Victoria; 2009. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1828/1966.

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

Council of Science Editors:

Williams AM. Shift gray codes. [Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1966

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

.