<div class="csl-bib-body">
<div class="csl-entry">Roitner, V. (2020). <i>Studies on several parameters in lattice paths</i> [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.74661</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2020.74661
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/16369
-
dc.description.abstract
This thesis deals with enumerative as well as asymptotic aspects of directed lattice paths. Several parameters appearing in lattice paths will be analyzed, e.g. the area enclosed by or the number of contacts between two paths or the number of occurrences of certain patterns in a path. The first chapter gives an overview over the history of lattice path theory as well as basic definitions and an overview of the applications of lattice paths in mathematical models arising in natural sciences or computer science. In the second chapter the methods used in enumerative and asymptotic combinatorics will be introduced: combinatorial classes and their generating functions for exact enumeration as well as singularity analysis for asymptotic results. There are two lattice path configurations on which this thesis mostly focuses: non-intersecting pairs (or tuples) of paths and paths which avoid patterns, i.e., fixed sequences of consecutivesteps. Chapter 3 deals with non-intersecting pairs of lattice paths. We will derive results abouttheir average number of contacts as well as the average area between them.Chapter 4 deals with pattern avoidance in lattice paths. First, the vectorial kernel methoddeveloped by Andrei Asinowski, Axel Bacher, Cyril Banderier, and Bernhard Gittenberger will be introduced, since it is a very powerful tool for enumerating lattice paths avoiding a fixed pattern as well as enumerating the occurrences of a fixed pattern in a lattice path. Then it will be generalized in two directions: for enumerating lattice paths with longer steps and for enumerating lattice paths which avoid several patterns at once. The tools developed in this section have also been used to prove a conjecture by David Callan about the asymptotic behavior of the expected number of ascents in Schröder paths.In Chapter 5 we will combine the methods from Chapter 3 and 4 for studying patternavoidance as well as the lower height in pairs of non-intersecting lattice paths. Some of the results in this thesis have already been published in scientific papers. For acomplete list of the publications this thesis is based on, see page IV.
en
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
Gitterpfade
de
dc.subject
asymptotische Abzählung
de
dc.subject
erzeugende Funktionen
de
dc.subject
Wassermelonenkonfigurationen
de
dc.subject
Mustervermeidung
de
dc.subject
Kernmethode
de
dc.subject
Lattice paths
en
dc.subject
asymptotic enumeration
en
dc.subject
generating functions
en
dc.subject
watermelon configurations
en
dc.subject
pattern avoidance
en
dc.subject
kernel method
en
dc.title
Studies on several parameters in lattice paths
en
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.identifier.doi
10.34726/hss.2020.74661
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Valerie Roitner
-
dc.publisher.place
Wien
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
tuw.publication.orgunit
E104 - Institut für Diskrete Mathematik und Geometrie
-
dc.type.qualificationlevel
Doctoral
-
dc.identifier.libraryid
AC16087774
-
dc.description.numberOfPages
115
-
dc.thesistype
Dissertation
de
dc.thesistype
Dissertation
en
tuw.author.orcid
0000-0002-2621-431X
-
dc.rights.identifier
In Copyright
en
dc.rights.identifier
Urheberrechtsschutz
de
tuw.advisor.staffStatus
staff
-
item.languageiso639-1
en
-
item.grantfulltext
open
-
item.cerifentitytype
Publications
-
item.openairetype
doctoral thesis
-
item.openairecristype
http://purl.org/coar/resource_type/c_db06
-
item.fulltext
with Fulltext
-
item.mimetype
application/pdf
-
item.openaccessfulltext
Open Access
-
crisitem.author.dept
E104-05 - Forschungsbereich Kombinatorik und Algorithmen
-
crisitem.author.parentorg
E104 - Institut für Diskrete Mathematik und Geometrie