subject:(Combinatorial enumeration)

Rutgers University

1. Shar, Nathaniel. Experimental methods in permutation patterns and bijective proof.

Degree: PhD, Mathematics, 2016, Rutgers University

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

►

Experimental mathematics is the technique of developing conjectures and proving theorems through the use of experimentation; that is, exploring finitely many cases and detecting patterns… (more)

Subjects/Keywords: Combinatorial enumeration problems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Shar, N. (2016). Experimental methods in permutation patterns and bijective proof. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/50595/

Chicago Manual of Style (16^th Edition):

Shar, Nathaniel. “Experimental methods in permutation patterns and bijective proof.” 2016. Doctoral Dissertation, Rutgers University. Accessed January 15, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/50595/.

MLA Handbook (7^th Edition):

Shar, Nathaniel. “Experimental methods in permutation patterns and bijective proof.” 2016. Web. 15 Jan 2021.

Vancouver:

Shar N. Experimental methods in permutation patterns and bijective proof. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2021 Jan 15]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/50595/.

Council of Science Editors:

Shar N. Experimental methods in permutation patterns and bijective proof. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/50595/

Oregon State University

2. Maxwell, Mark M. Asymptotic enumeration for combinatorial structures.

Degree: PhD, Mathematics, 1994, Oregon State University

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

► There are many combinatorial structures which can be regarded as complexes of certain basic blocks. Familiar examples are involutions, finite graphs, and Stirling numbers of… (more)

Subjects/Keywords: Combinatorial enumeration problems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Maxwell, M. M. (1994). Asymptotic enumeration for combinatorial structures. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/16827

Chicago Manual of Style (16^th Edition):

Maxwell, Mark M. “Asymptotic enumeration for combinatorial structures.” 1994. Doctoral Dissertation, Oregon State University. Accessed January 15, 2021. http://hdl.handle.net/1957/16827.

MLA Handbook (7^th Edition):

Maxwell, Mark M. “Asymptotic enumeration for combinatorial structures.” 1994. Web. 15 Jan 2021.

Vancouver:

Maxwell MM. Asymptotic enumeration for combinatorial structures. [Internet] [Doctoral dissertation]. Oregon State University; 1994. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1957/16827.

Council of Science Editors:

Maxwell MM. Asymptotic enumeration for combinatorial structures. [Doctoral Dissertation]. Oregon State University; 1994. Available from: http://hdl.handle.net/1957/16827

Florida Atlantic University

3. Sullivan, Shaun. Multivariate finite operator calculus applied to counting ballot paths containing patterns.

Degree: PhD, 2011, Florida Atlantic University

URL: http://purl.flvc.org/FAU/3174076

►

Summary: Counting lattice paths where the number of occurrences of a given pattern is monitored requires a careful analysis of the pattern. Not the length,… (more)

Subjects/Keywords: Combinatorial probabilities; Lattice paths; Combinatorial enumeration problems; Generating functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sullivan, S. (2011). Multivariate finite operator calculus applied to counting ballot paths containing patterns. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/3174076

Chicago Manual of Style (16^th Edition):

Sullivan, Shaun. “Multivariate finite operator calculus applied to counting ballot paths containing patterns.” 2011. Doctoral Dissertation, Florida Atlantic University. Accessed January 15, 2021. http://purl.flvc.org/FAU/3174076.

MLA Handbook (7^th Edition):

Sullivan, Shaun. “Multivariate finite operator calculus applied to counting ballot paths containing patterns.” 2011. Web. 15 Jan 2021.

Vancouver:

Sullivan S. Multivariate finite operator calculus applied to counting ballot paths containing patterns. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2011. [cited 2021 Jan 15]. Available from: http://purl.flvc.org/FAU/3174076.

Council of Science Editors:

Sullivan S. Multivariate finite operator calculus applied to counting ballot paths containing patterns. [Doctoral Dissertation]. Florida Atlantic University; 2011. Available from: http://purl.flvc.org/FAU/3174076

Michigan State University

4. Baker-Jarvis, Duff. Bijective proofs for the shuffle compatibility of descent statistics.

Degree: 2019, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:47771

►

Thesis Ph. D. Michigan State University. Mathematics 2019

"Define a permutation to be any sequence of distinct positive integers. Given two permutations pi and sigma… (more)

Subjects/Keywords: Nonparametric statistics; Combinatorial analysis; Distribution (Probability theory); Combinatorial enumeration problems; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Baker-Jarvis, D. (2019). Bijective proofs for the shuffle compatibility of descent statistics. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:47771

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

Baker-Jarvis, Duff. “Bijective proofs for the shuffle compatibility of descent statistics.” 2019. Thesis, Michigan State University. Accessed January 15, 2021. http://etd.lib.msu.edu/islandora/object/etd:47771.

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

MLA Handbook (7^th Edition):

Baker-Jarvis, Duff. “Bijective proofs for the shuffle compatibility of descent statistics.” 2019. Web. 15 Jan 2021.

Vancouver:

Baker-Jarvis D. Bijective proofs for the shuffle compatibility of descent statistics. [Internet] [Thesis]. Michigan State University; 2019. [cited 2021 Jan 15]. Available from: http://etd.lib.msu.edu/islandora/object/etd:47771.

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

Council of Science Editors:

Baker-Jarvis D. Bijective proofs for the shuffle compatibility of descent statistics. [Thesis]. Michigan State University; 2019. Available from: http://etd.lib.msu.edu/islandora/object/etd:47771

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

Reykjavík University

5. Christian Bean 1993-. Finding structure in permutation sets .

Degree: 2018, Reykjavík University

URL: http://hdl.handle.net/1946/31663

► New automatic methods for enumerating permutation classes are introduced. The first is Struct, which is an algorithm that conjectures a structural description using rules similar… (more)

Subjects/Keywords: Tölvunarfræði; Doktorsritgerðir; Talningarfræði; Computer science; Combinatorial enumeration problems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

1993-, C. B. (2018). Finding structure in permutation sets . (Thesis). Reykjavík University. Retrieved from http://hdl.handle.net/1946/31663

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

1993-, Christian Bean. “Finding structure in permutation sets .” 2018. Thesis, Reykjavík University. Accessed January 15, 2021. http://hdl.handle.net/1946/31663.

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

MLA Handbook (7^th Edition):

1993-, Christian Bean. “Finding structure in permutation sets .” 2018. Web. 15 Jan 2021.

Vancouver:

1993- CB. Finding structure in permutation sets . [Internet] [Thesis]. Reykjavík University; 2018. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1946/31663.

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

Council of Science Editors:

1993- CB. Finding structure in permutation sets . [Thesis]. Reykjavík University; 2018. Available from: http://hdl.handle.net/1946/31663

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

Michigan State University

6. Ionel, Eleny-Nocoleta. Genus one enumerative invariants in Pn.

Degree: PhD, Department of Mathematics, 1995, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:25986

Subjects/Keywords: Geometry, Algebraic; Combinatorial enumeration problems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ionel, E. (1995). Genus one enumerative invariants in Pn. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:25986

Chicago Manual of Style (16^th Edition):

Ionel, Eleny-Nocoleta. “Genus one enumerative invariants in Pn.” 1995. Doctoral Dissertation, Michigan State University. Accessed January 15, 2021. http://etd.lib.msu.edu/islandora/object/etd:25986.

MLA Handbook (7^th Edition):

Ionel, Eleny-Nocoleta. “Genus one enumerative invariants in Pn.” 1995. Web. 15 Jan 2021.

Vancouver:

Ionel E. Genus one enumerative invariants in Pn. [Internet] [Doctoral dissertation]. Michigan State University; 1995. [cited 2021 Jan 15]. Available from: http://etd.lib.msu.edu/islandora/object/etd:25986.

Council of Science Editors:

Ionel E. Genus one enumerative invariants in Pn. [Doctoral Dissertation]. Michigan State University; 1995. Available from: http://etd.lib.msu.edu/islandora/object/etd:25986

Stellenbosch University

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

Degree: MSc, Mathematical Sciences, 2019, Stellenbosch University

URL: http://hdl.handle.net/10019.1/107091

►

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)

▼

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 step set f(1; 1); (1;􀀀k)g called k-Dyck paths, which are enumerated by the generalised Catalan numbers 1 (k+1)n+1 􀀀(k+1)n+1 n . By removing the non-negativity condition but restricting the path to stay above the line y = 􀀀t we obtain a family of lattice paths called kt-Dyck paths which are enumerated by `generalised generalised Catalan numbers t + 1 (k + 1)n + t + 1 (k + 1)n + t + 1 n : We provide proofs of the enumeration of these paths by means of a bijection, the kernel method, the cycle lemma, and the symbolic method. Analysis of parameters associated with the paths is also performed using symbolic equations { particularly the number of peaks, the number of valleys, and the number of returns. These kt-Dyck paths nd application in enumerating a family of walks in the quarter plane (Z 0 Z 0) with step set f(1; 1); (1;􀀀k +1); (􀀀k; 0)g. Such walks can be decomposed into ordered pairs of kt-Dyck paths and thus their enumeration can be proved via a simple bijection. Through this bijection some parameters in kt-Dyck paths are preserved. Finally, we discuss two different families of lattice paths, S-Motzkin and T- Motzkin paths, which are related to kt-Dyck paths when k = 2 along with t = 0 and t = 1. We provide bijections between these paths and other combinatorial objects, and perform analysis of parameters in these paths.

AFRIKAANSE OPSOMMING: (Verwys na volteks opsomming vir simbole wat nie korrek oorgeskryf het nie). Ons beskou 'n familie van nie-negatiewe roosterpaaie wat bestaan uit die stap- versameling f(1; 1); (1;􀀀k)g genoem k-Dyck paaie, wat deur die veralgemeende Catalan getalle, 1 (k+1)n+1 􀀀(k+1)n+1 n , getel word. Deur die nie-negatiwiteitsvereiste te verwyder, maar die pad tot bokant die lyn y = 􀀀t te beperk kry ons 'n fami- lie roosterpaaie genaamd kt-Dyck paaie wat getel word deur `veralgemeende' veralgemeende Catalan getalle t + 1 (k + 1)n + t + 1 (k + 1)n + t + 1 n : Ons lewer 'n bewys van die aftelling van hierdie paaie deur middel van 'n bijeksie, die kernmetode, die sikluslemma en die simboliese metode. Analise van parameters wat met die paaie geassosieer word, word ook uitgevoer met behulp van simboliese vergelykings { veral die aantal pieke, die aantal valleie en die aantal terugkomste. Hierdie kt-Dyck paaie vind 'n toepassing in 'n familie van wandelinge in die kwartvlak (Z 0 Z 0) met stapversameling f(1; 1); (1;􀀀k + 1); (􀀀k; 0)g. Sulke wandelinge kan ontleed word in geordende pare kt-Dyck paaie en dus kan hul aftelling deur middel van 'n eenvoudige bijeksie bewys word. Deur hierdie bijeksie word 'n paar parameters in kt-Dyck paaie bewaar. Laastens bespreek ons twee verskillende families van roosterpaaie, S-Motzkin en T-Motzkin paaie, wat verband hou met kt-Dyck paaie wanneer k = 2 saam met t = 0 en t = 1. Ons bied bijeksies tussen hierdie paaie en ander kom- binatoriese voorwerpe,…

Advisors/Committee Members: Wagner, Stephan, Prodinger, Helmut, Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences..

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

Record Details Similar Records Cite « Share

❌

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

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

8. Koda, Yasunori. Combinatorial algorithms on partially ordered sets.

Degree: Department of Computer Science, 2018, University of Victoria

URL: https://dspace.library.uvic.ca//handle/1828/9558

► The main results of this dissertation are various algorithms related to partially ordered sets. The dissertation basically consists of two parts. The first part treats… (more)

Subjects/Keywords: Combinatorial enumeration problems; Partially ordered sets

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Koda, Y. (2018). Combinatorial algorithms on partially ordered sets. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9558

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

Koda, Yasunori. “Combinatorial algorithms on partially ordered sets.” 2018. Thesis, University of Victoria. Accessed January 15, 2021. https://dspace.library.uvic.ca//handle/1828/9558.

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

MLA Handbook (7^th Edition):

Koda, Yasunori. “Combinatorial algorithms on partially ordered sets.” 2018. Web. 15 Jan 2021.

Vancouver:

Koda Y. Combinatorial algorithms on partially ordered sets. [Internet] [Thesis]. University of Victoria; 2018. [cited 2021 Jan 15]. Available from: https://dspace.library.uvic.ca//handle/1828/9558.

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

Council of Science Editors:

Koda Y. Combinatorial algorithms on partially ordered sets. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9558

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

Freie Universität Berlin

9. Jochemko, Katharina Victoria. Über die Kombinatorik von Bewertungen.

Degree: 2015, Freie Universität Berlin

URL: https://refubium.fu-berlin.de/handle/fub188/11166

► Die vorliegende Arbeit beschäftigt sich mit der Struktur translationsinvarianter Bewertungen auf Polytopen und damit im Zusammenhang stehenden Abzählproblemen mit geometrischen Lösungsansätzen. Den Ausgangspunkt des ersten… (more)

▼ Die vorliegende Arbeit beschäftigt sich mit der Struktur translationsinvarianter Bewertungen auf Polytopen und damit im Zusammenhang stehenden Abzählproblemen mit geometrischen Lösungsansätzen. Den Ausgangspunkt des ersten Kapitels bilden zwei Resultate von Richard Stanley: Zum einen sein bahnbrechendes Nonnegativity Theorem, welches aussagt, dass der Ehrhart h*-Vektor jedes Gitterpolytops nur nichtnegative ganze Zahlen enthält. Zum anderen zeigte er, dass dieser Vektor eine Monotonieeigenschaft besitzt. In Kapitel 2 untersuchen wir allgemein translationsinvariante Bewertungen auf diese Eigenschaften hin. Unser Hauptresultat ist, dass Nichtnegativität und Monotonie äquivalent sind, und wir geben eine einfache Charakterisierung an. In Kapitel 3 zeigen wir, dass der h*-Vektor eines Zonotops unimodal ist, falls die entsprechende translations-invariante Bewertung die Monotoniebedingung erfüllt. Der zweite Teil der Arbeit behandelt Abzählprobleme für ordnungserhaltenden Abbildungen. Für gegebene partielle Ordnungen A und P derart, dass A in P enthalten ist, und eine ordnungserhaltende Abbildung f von A nach [n] zeigen wir in Kapitel 4, dass die Anzahl der Fortsetzungen von f nach P durch ein stückweise multivariates Polynom gegeben ist. Angewandt auf das Zählen von Fortsetzungen von Graphenfärbungen verallgemeinert dies einen Satz von Herzberg und Murty. Zudem enumerieren wir Monotone Triangles, welche in engem Zusammenhang mit Alternating Sign Matrices stehen, und können einen kurzen geometrischen Beweis einer Reziprozität von Fischer und Riegler angeben. In Kapitel 5 zählen wir ordnungserhaltende Abbildungen von P nach [n] bis auf Symmetry. Wir zeigen, dass die Zählfunktion ein Polynom in n ist und beweisen eine ordnungstheoretische Verallgemeinerung von Pólya’s Enumeration Theorem. Zudem zeigen wir eine Reziprozität und wenden unsere Resultate darauf an Graphenfärbungen bis auf Symmetrie zu zählen. Advisors/Committee Members: w (gender), Professor Dr. Raman Sanyal (firstReferee), Professor Matthias Beck, Ph.D. (furtherReferee).

Subjects/Keywords: Polytopes; valuations; nonnegativity; lattice point enumeration; unimodality; order preserving maps; combinatorial reciprocity;

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Jochemko, K. V. (2015). Über die Kombinatorik von Bewertungen. (Thesis). Freie Universität Berlin. Retrieved from https://refubium.fu-berlin.de/handle/fub188/11166

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

Jochemko, Katharina Victoria. “Über die Kombinatorik von Bewertungen.” 2015. Thesis, Freie Universität Berlin. Accessed January 15, 2021. https://refubium.fu-berlin.de/handle/fub188/11166.

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

MLA Handbook (7^th Edition):

Jochemko, Katharina Victoria. “Über die Kombinatorik von Bewertungen.” 2015. Web. 15 Jan 2021.

Vancouver:

Jochemko KV. Über die Kombinatorik von Bewertungen. [Internet] [Thesis]. Freie Universität Berlin; 2015. [cited 2021 Jan 15]. Available from: https://refubium.fu-berlin.de/handle/fub188/11166.

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

Council of Science Editors:

Jochemko KV. Über die Kombinatorik von Bewertungen. [Thesis]. Freie Universität Berlin; 2015. Available from: https://refubium.fu-berlin.de/handle/fub188/11166

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

University of Oxford

10. Farr, Graham E. Topics in computational complexity.

Degree: PhD, 1986, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525

The final Chapter concerns a problem of partitioning graphs subject to certain restrictions. We prove that several subproblems are NP-complete.

Subjects/Keywords: 510; Computational complexity : Combinatorial enumeration problems : Percolation (Statistical physics)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Farr, G. E. (1986). Topics in computational complexity. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525

Chicago Manual of Style (16^th Edition):

Farr, Graham E. “Topics in computational complexity.” 1986. Doctoral Dissertation, University of Oxford. Accessed January 15, 2021. http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525.

MLA Handbook (7^th Edition):

Farr, Graham E. “Topics in computational complexity.” 1986. Web. 15 Jan 2021.

Vancouver:

Farr GE. Topics in computational complexity. [Internet] [Doctoral dissertation]. University of Oxford; 1986. [cited 2021 Jan 15]. Available from: http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525.

Council of Science Editors:

Farr GE. Topics in computational complexity. [Doctoral Dissertation]. University of Oxford; 1986. Available from: http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525

Florida Atlantic University

11. Bozovic, Vladimir. Algebraic and combinatorial aspects of group factorizations.

Degree: PhD, 2008, Florida Atlantic University

URL: http://purl.flvc.org/FAU/107805

►

Summary: The aim of this work is to investigate some algebraic and combinatorial aspects of group factorizations. The main contribution of this dissertation is a… (more)

Subjects/Keywords: Physical measurements; Mapping (Mathematics); Combinatorial enumeration problems; Algebra, Abstract

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bozovic, V. (2008). Algebraic and combinatorial aspects of group factorizations. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/107805

Chicago Manual of Style (16^th Edition):

Bozovic, Vladimir. “Algebraic and combinatorial aspects of group factorizations.” 2008. Doctoral Dissertation, Florida Atlantic University. Accessed January 15, 2021. http://purl.flvc.org/FAU/107805.

MLA Handbook (7^th Edition):

Bozovic, Vladimir. “Algebraic and combinatorial aspects of group factorizations.” 2008. Web. 15 Jan 2021.

Vancouver:

Bozovic V. Algebraic and combinatorial aspects of group factorizations. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2008. [cited 2021 Jan 15]. Available from: http://purl.flvc.org/FAU/107805.

Council of Science Editors:

Bozovic V. Algebraic and combinatorial aspects of group factorizations. [Doctoral Dissertation]. Florida Atlantic University; 2008. Available from: http://purl.flvc.org/FAU/107805

Virginia Tech

12. Ramachandran, Sridhar. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem.

Degree: MS, Industrial and Systems Engineering, 1991, Virginia Tech

URL: http://hdl.handle.net/10919/45116

Subjects/Keywords: Combinatorial enumeration problems; LD5655.V855 1991.R363

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ramachandran, S. (1991). A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/45116

Chicago Manual of Style (16^th Edition):

Ramachandran, Sridhar. “A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem.” 1991. Masters Thesis, Virginia Tech. Accessed January 15, 2021. http://hdl.handle.net/10919/45116.

MLA Handbook (7^th Edition):

Ramachandran, Sridhar. “A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem.” 1991. Web. 15 Jan 2021.

Vancouver:

Ramachandran S. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem. [Internet] [Masters thesis]. Virginia Tech; 1991. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10919/45116.

Council of Science Editors:

Ramachandran S. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem. [Masters Thesis]. Virginia Tech; 1991. Available from: http://hdl.handle.net/10919/45116

Simon Fraser University

13. Ahmad, Seema. Some results on the structure of the [sigma]2 enumeration degrees.

Degree: 1989, Simon Fraser University

URL: http://summit.sfu.ca/item/7884

Subjects/Keywords: Recursive functions.; Computable functions.; Combinatorial enumeration problems.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ahmad, S. (1989). Some results on the structure of the [sigma]2 enumeration degrees. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/7884

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

Ahmad, Seema. “Some results on the structure of the [sigma]2 enumeration degrees.” 1989. Thesis, Simon Fraser University. Accessed January 15, 2021. http://summit.sfu.ca/item/7884.

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

MLA Handbook (7^th Edition):

Ahmad, Seema. “Some results on the structure of the [sigma]2 enumeration degrees.” 1989. Web. 15 Jan 2021.

Vancouver:

Ahmad S. Some results on the structure of the [sigma]2 enumeration degrees. [Internet] [Thesis]. Simon Fraser University; 1989. [cited 2021 Jan 15]. Available from: http://summit.sfu.ca/item/7884.

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

Council of Science Editors:

Ahmad S. Some results on the structure of the [sigma]2 enumeration degrees. [Thesis]. Simon Fraser University; 1989. Available from: http://summit.sfu.ca/item/7884

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

Simon Fraser University

14. Wehner, Stephan. Computable enumeration and the problem of repetition.

Degree: 1995, Simon Fraser University

URL: http://summit.sfu.ca/item/6715

Subjects/Keywords: Combinatorial enumeration problems.; Computable functions.; Recursion theory.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wehner, S. (1995). Computable enumeration and the problem of repetition. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/6715

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

Wehner, Stephan. “Computable enumeration and the problem of repetition.” 1995. Thesis, Simon Fraser University. Accessed January 15, 2021. http://summit.sfu.ca/item/6715.

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

MLA Handbook (7^th Edition):

Wehner, Stephan. “Computable enumeration and the problem of repetition.” 1995. Web. 15 Jan 2021.

Vancouver:

Wehner S. Computable enumeration and the problem of repetition. [Internet] [Thesis]. Simon Fraser University; 1995. [cited 2021 Jan 15]. Available from: http://summit.sfu.ca/item/6715.

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

Council of Science Editors:

Wehner S. Computable enumeration and the problem of repetition. [Thesis]. Simon Fraser University; 1995. Available from: http://summit.sfu.ca/item/6715

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

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

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

URL: http://hdl.handle.net/10442/hedi/34603

►

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)

▼

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 problems. Professor R. Stanley maintains a record including more than 200 different combinatorial objects which are enumerated by the Catalan numbers, therefore are structurally equivalent. Perhaps, the most popular among these are Dyck paths (or words) and binary trees.Dyck paths are the main object studied in this dissertation. They have a very simple geometrical representation and for that reason they are suitable for studying properties which are then translated into properties of other objects in the Catalan family.Moreover, by introducing various restrictions (parameters), we obtain special categories of Dyck paths which are often equivalent to other known objects, so that any results are also extended to these objects.In this dissertation, we mainly study the parameter “number of occurrences of the string t”, where a string is considered to be any binary word. In the first chapter, the basic definitions and necessary mathematical tools are extensively presented.In the second chapter, we study the parameter “number of occurrences of t at height j”, that is we enumerate Dyck paths, with respect to their length and number of occurrences of t at height j. The result is expressed via the corresponding generating function for any binary word t.In the third chapter, we study the parameters “number of occurrences of t” and “number of occurrences of t at height at least j” in Dyck paths. We again obtain the results via the corresponding generating function for the cases where t is a Dyck prefix or a Dyck suffix and for some other general cases as well. In the fourth chapter, we study the parameter “number of occurrences of t” in Grand-Dyck paths, where t has length 3. In addition, by considering the auxiliary parameter “number of up-steps below zero level”, we obtain in some cases refinements of the Chung-Feller theorem. In the fifth chapter, three new parameters of Dyck paths, not related to strings, are studied and complete enumerative results are obtained. These parameters are defined by refining the well known parameter “number of peaks”. In the sixth chapter, exact as well as asymptotic formulas are presented, for the mean value and variance of the parameters studied in previous chapters.

Οι αριθμοί Catalan θεωρούνται ως οι πιο σημαντικοί αριθμοί της Συνδυαστικής, μετά τους διωνυμικούς συντελεστές, λόγω της εντυπωσιακά συχνής εμφάνισής τους σε διάφορα προβλήματα. Ενδεικτικά, ο R. Stanley διατηρεί αρχείο με περισσότερα από 200 διαφορετικά σύνολα συνδυαστικών αντικείμενων που απαριθμούνται από τους αριθμούς Catalan και άρα είναι πληθικά αλλά και δομικά ισοδύναμα. Τα πιο διαδεδομένα από αυτά είναι ίσως τα μονοπάτια (λέξεις) Dyck και τα δυαδικά δένδρα.Το κεντρικό αντικείμενο μελέτης της διατριβής αυτής είναι τα μονοπάτια Dyck, τα οποία αποτελούν απλά μια αναπαράσταση στο επίπεδο των λέξεων Dyck. Λόγω της απλής και εύληπτης γεωμετρικής…

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

Record Details Similar Records Cite « Share

❌

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

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

California State University – San Bernardino

16. Nazzal, Lamies Joureus. Homomorphic images of semi-direct products.

Degree: MAin Mathematics, Mathematics, 2004, California State University – San Bernardino

URL: https://scholarworks.lib.csusb.edu/etd-project/2770

The main purpose of this thesis is to describe methods of constructing computer-free proofs of existence of finite groups and give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.

Subjects/Keywords: Finite groups; Products of subgroups; Combinatorial enumeration problems; Isomorphisms (Mathematics); Representations of groups; Symmetric domains; Group theory; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nazzal, L. J. (2004). Homomorphic images of semi-direct products. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd-project/2770

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

Nazzal, Lamies Joureus. “Homomorphic images of semi-direct products.” 2004. Thesis, California State University – San Bernardino. Accessed January 15, 2021. https://scholarworks.lib.csusb.edu/etd-project/2770.

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

MLA Handbook (7^th Edition):

Nazzal, Lamies Joureus. “Homomorphic images of semi-direct products.” 2004. Web. 15 Jan 2021.

Vancouver:

Nazzal LJ. Homomorphic images of semi-direct products. [Internet] [Thesis]. California State University – San Bernardino; 2004. [cited 2021 Jan 15]. Available from: https://scholarworks.lib.csusb.edu/etd-project/2770.

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

Council of Science Editors:

Nazzal LJ. Homomorphic images of semi-direct products. [Thesis]. California State University – San Bernardino; 2004. Available from: https://scholarworks.lib.csusb.edu/etd-project/2770

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

University of Queensland

17. Marbach, Trent. Latin Squares and Related Structures.

Degree: School of Mathematics & Physics, 2016, University of Queensland

URL: http://espace.library.uq.edu.au/view/UQ:400935

Subjects/Keywords: latin square; latin trade; transversal; nearly orthogonal; k-homogeneous; intersection problem; combinatorial enumeration; 0101 Pure Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Marbach, T. (2016). Latin Squares and Related Structures. (Thesis). University of Queensland. Retrieved from http://espace.library.uq.edu.au/view/UQ:400935

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

Marbach, Trent. “Latin Squares and Related Structures.” 2016. Thesis, University of Queensland. Accessed January 15, 2021. http://espace.library.uq.edu.au/view/UQ:400935.

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

MLA Handbook (7^th Edition):

Marbach, Trent. “Latin Squares and Related Structures.” 2016. Web. 15 Jan 2021.

Vancouver:

Marbach T. Latin Squares and Related Structures. [Internet] [Thesis]. University of Queensland; 2016. [cited 2021 Jan 15]. Available from: http://espace.library.uq.edu.au/view/UQ:400935.

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

Council of Science Editors:

Marbach T. Latin Squares and Related Structures. [Thesis]. University of Queensland; 2016. Available from: http://espace.library.uq.edu.au/view/UQ:400935

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

18. Belhoul, Lyes. Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration.

Degree: Docteur es, Informatique, 2014, Paris 9

URL: http://www.theses.fr/2014PA090060

►

Notre objectif dans cette thèse est de proposer des algorithmes efficaces pour résoudre des problèmes d’optimisation combinatoire difficiles. Dans un premier temps, nous établissons le… (more)

▼

Notre objectif dans cette thèse est de proposer des algorithmes efficaces pour résoudre des problèmes d’optimisation combinatoire difficiles. Dans un premier temps, nous établissons le principe de l’énumération ordonnée qui consiste à générer dans un ordre adéquat les solutions d’un problème relâché associé au problème principal jusqu’à l’obtention de la preuve d’optimalité d’une solution. Nous construisons une procédure générique dans le cadre général des problème d’optimisation combinatoire. Dans un second temps nous abordons les applications de notre algorithme sur des problèmes qui admettent le problème d’affectation comme relaxation. Le premier cas particulier que nous étudions est la recherche d’une solution de bon compromis pour le problème d’affectation multiobjectif. La seconde application se rapporte au problème du voyageur de commerce asymétrique qui présente la difficulté de comporter des contraintes qui interdisent les sous-tournées, en plus des contraintes du problème d’affectation.

Our aim in this thesis is to propose efficient algorithms for solving difficult combinatorial optimization problems. Our algorithms are based on a generic method of ordered enumeration. Initially, we describe the principle of ordered enumeration which consists in generating in a specific order solutions of a relaxed problem associated to the difficult main problem, until meeting a proof of the optimality of a feasible solution. We construct a generic procedure in the general context of combinatorial optimization problems. In a second step we discuss applications of our algorithm on some difficult problems which admit the assignment problem as relaxation. The first special case we study is the search for a compromise solution to the multiobjective assignment problem. The second application is the asymmetric travelling salesman problem, which contains sub-tour constraints in addition to the constraints of the assignment problem.

Advisors/Committee Members: Vanderpooten, Daniel (thesis director).

Subjects/Keywords: Énumération ordonnée; Branch and Bound; Problèmes d’optimisation combinatoire mono et multi-Objectifs; Problème d’affectation; Problème du voyageur de commerce asymétrique; Ordered Enumeration; Branch and Bound; Mono and Multi-Objective Combinatorial Optimization Problems; Assignment Problem; Asymmetric Travelling Salesman Problem; 004

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Belhoul, L. (2014). Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration. (Doctoral Dissertation). Paris 9. Retrieved from http://www.theses.fr/2014PA090060

Chicago Manual of Style (16^th Edition):

Belhoul, Lyes. “Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration.” 2014. Doctoral Dissertation, Paris 9. Accessed January 15, 2021. http://www.theses.fr/2014PA090060.

MLA Handbook (7^th Edition):

Belhoul, Lyes. “Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration.” 2014. Web. 15 Jan 2021.

Vancouver:

Belhoul L. Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration. [Internet] [Doctoral dissertation]. Paris 9; 2014. [cited 2021 Jan 15]. Available from: http://www.theses.fr/2014PA090060.

Council of Science Editors:

Belhoul L. Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration. [Doctoral Dissertation]. Paris 9; 2014. Available from: http://www.theses.fr/2014PA090060

19. Carroll, Christina C. Enumerative combinatorics of posets.

Degree: PhD, Mathematics, 2008, Georgia Tech

URL: http://hdl.handle.net/1853/22659

► This thesis contains several results concerning the combinatorics of partially ordered sets (posets) which are either of enumerative or extremal nature. The first concerns conjectures… (more)

Subjects/Keywords: Enumeration; Entropy; Dedekind's problem; Combinatorial analysis; Partially ordered sets; Graph theory

…1.4 Entropy as an Enumeration Tool Entropy is a concept which has its origins in physics…

3 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Carroll, C. C. (2008). Enumerative combinatorics of posets. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/22659

Chicago Manual of Style (16^th Edition):

Carroll, Christina C. “Enumerative combinatorics of posets.” 2008. Doctoral Dissertation, Georgia Tech. Accessed January 15, 2021. http://hdl.handle.net/1853/22659.

MLA Handbook (7^th Edition):

Carroll, Christina C. “Enumerative combinatorics of posets.” 2008. Web. 15 Jan 2021.

Vancouver:

Carroll CC. Enumerative combinatorics of posets. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1853/22659.

Council of Science Editors:

Carroll CC. Enumerative combinatorics of posets. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/22659

20. Erickson, Alejandro. Monomino-Domino Tatami Coverings.

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

URL: http://hdl.handle.net/1828/4902

► We present several new results on the combinatorial properties of a locally restricted version of monomino-domino coverings of rectilinear regions. These are monomino-domino tatami coverings,… (more)

Subjects/Keywords: combinatorics; cstheory; math.CO; cs.CC; computer science theory; mathematics; tiling; covering; tatami restriction; monomino; domino; enumeration; combinatorial algorithms; combinatorial generation; computational complexity

…most natural of these, and it imposes a visually appealing structure with nice combinatorial… …Chapters 3 and 4, followed by natural extensions to combinatorial algorithms, in Chapter 5… …the one mentioned above. 1.1 Main results The combinatorial richness of tatami coverings… …characterisation or enumeration of them would be much more complicated. The structure discovered by the… …encapsulate some of the combinatorial properties of coverings of the rectangle. Here, isomorphism…

3 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Erickson, A. (2013). Monomino-Domino Tatami Coverings. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4902

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

Erickson, Alejandro. “Monomino-Domino Tatami Coverings.” 2013. Thesis, University of Victoria. Accessed January 15, 2021. http://hdl.handle.net/1828/4902.

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

MLA Handbook (7^th Edition):

Erickson, Alejandro. “Monomino-Domino Tatami Coverings.” 2013. Web. 15 Jan 2021.

Vancouver:

Erickson A. Monomino-Domino Tatami Coverings. [Internet] [Thesis]. University of Victoria; 2013. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1828/4902.

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

Council of Science Editors:

Erickson A. Monomino-Domino Tatami Coverings. [Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4902

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

ETH Zürich

21. Razen, Andreas. Crossing-Free Configurations on Planar Point Sets.

Degree: 2009, ETH Zürich

URL: http://hdl.handle.net/20.500.11850/72836

Subjects/Keywords: GRAPH TRANSFORMATIONS (GRAPH THEORY); COMBINATORIAL ENUMERATION; GRAPHENZERLEGUNG (GRAPHENTHEORIE); GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); ABZÄHLENDE KOMBINATORIK; GRAPH PARTITIONING (GRAPH THEORY); GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY); GRAPHENTRANSFORMATIONEN (GRAPHENTHEORIE); info:eu-repo/classification/ddc/510; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Razen, A. (2009). Crossing-Free Configurations on Planar Point Sets. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72836

Chicago Manual of Style (16^th Edition):

Razen, Andreas. “Crossing-Free Configurations on Planar Point Sets.” 2009. Doctoral Dissertation, ETH Zürich. Accessed January 15, 2021. http://hdl.handle.net/20.500.11850/72836.

MLA Handbook (7^th Edition):

Razen, Andreas. “Crossing-Free Configurations on Planar Point Sets.” 2009. Web. 15 Jan 2021.

Vancouver:

Razen A. Crossing-Free Configurations on Planar Point Sets. [Internet] [Doctoral dissertation]. ETH Zürich; 2009. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/20.500.11850/72836.

Council of Science Editors:

Razen A. Crossing-Free Configurations on Planar Point Sets. [Doctoral Dissertation]. ETH Zürich; 2009. Available from: http://hdl.handle.net/20.500.11850/72836

22. Βαμβακάρη, Μαλβίνα. Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις.

Degree: 1997, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)

URL: http://hdl.handle.net/10442/hedi/19922

Subjects/Keywords: Συνδυαστικές δομές; Κεντρικά οριακά θεωρήματα; Τοπικά οριακά θεωρήματα; Ορθογώνια πολυώνυμα; Σύνολα και πολυώνυμα συζεύξεως γραφημάτων; Ταχύτητα σύγκλισης; Ασυμπτωτικές μέθοδοι απαρίθμησης; Μονοδιάστατες-πολυδιάστατες διακριτές κατανομές δυναμοσειράς; Univariate-multivariate discrete power series distributions; Combinatorial structures; Central limit theorems; Local linit theorems; Orthogonal polynomials; Matching sets and polynomials of graphs; Rate of convergence; Asymptotic methods of enumeration

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Βαμβακάρη, . �. (1997). Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/19922

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

Βαμβακάρη, Μαλβίνα. “Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις.” 1997. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed January 15, 2021. http://hdl.handle.net/10442/hedi/19922.

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

MLA Handbook (7^th Edition):

Βαμβακάρη, Μαλβίνα. “Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις.” 1997. Web. 15 Jan 2021.

Vancouver:

Βαμβακάρη �. Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 1997. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10442/hedi/19922.

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

Council of Science Editors:

Βαμβακάρη �. Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 1997. Available from: http://hdl.handle.net/10442/hedi/19922

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

University of Victoria

23. Williams, Aaron Michael. Shift gray codes.

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

URL: http://hdl.handle.net/1828/1966

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

▼ 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 to the balanced parentheses (()()). Given a string s = s1 s2 sn, the right-shift operation shift(s, i, j) replaces the substring si si+1..sj by si+1..sj si. In other words, si is right-shifted into position j by applying the permutation (j j−1 .. i) to the indices of s. Right-shifts include prefix-shifts (i = 1) and adjacent-transpositions (j = i+1). A fixed-content language is a set of strings that contain the same multiset of symbols. Given a fixed-content language, a shift Gray code is a list of its strings where consecutive strings differ by a shift. This thesis asks if shift Gray codes exist for a variety of combinatorial objects. This abstract question leads to a number of practical answers. The first prefix-shift Gray code for multiset permutations is discovered, and it provides the first algorithm for generating multiset permutations in O(1)-time while using O(1) additional variables. Applications of these results include more efficient exhaustive solutions to stacker-crane problems, which are natural NP-complete traveling salesman variants. This thesis also produces the fastest algorithm for generating balanced parentheses in an array, and the first minimal-change order for fixed-content necklaces and Lyndon words. These results are consequences of the following theorem: Every bubble language has a right-shift Gray code. Bubble languages are fixed-content languages that are closed under certain adjacent-transpositions. These languages generalize classic combinatorial objects: k-ary trees, ordered trees with fixed branching sequences, unit interval graphs, restricted Schr oder and Motzkin paths, linear-extensions of B-posets, and their unions, intersections, and quotients. Each Gray code is circular and is obtained from a new variation of lexicographic order known as cool-lex order. Gray codes using only shift(s, 1, n) and shift(s, 1, n−1) are also found for multiset permutations. A universal cycle that omits the last (redundant) symbol from each permutation is obtained by recording the first symbol of each permutation in this Gray code. As a special case, these shorthand universal cycles provide a new fixed-density analogue to de Bruijn cycles, and the first universal cycle for the "middle levels" (binary strings of length 2k + 1 with sum k or k + 1). Advisors/Committee Members: Ruskey, Frank (supervisor), Myrvold, W. J. (supervisor).

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 Details Similar Records Cite « Share

❌

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

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

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations