<div class="csl-bib-body">
<div class="csl-entry">Nessmann, A. (2023). <i>Discrete polyharmonic functions and their applications in combinatorics</i> [Dissertation, Technische Universität Wien; Université de Tours]. reposiTUm. https://doi.org/10.34726/hss.2023.98662</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2023.98662
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/190677
-
dc.description
Zusammenfassungen in deutscher und französischer Sprache
-
dc.description.abstract
The starting point for this thesis was the article by Chapon, Fusy and Raschel, where the authors noticed that in some a symptotic expansions of lattice path models in the quarter plane the dependency on the endpoint is given by so-called discrete polyharmonic functions, and went to show that the continuous analogue holds (i.e. the heat kernel allows for an expansion using continuous polyharmonic functions). It was already shown by Denisov and Wachtel that, under some slight technical assumptions, the asymptotics of the number of lattice paths in a cone are in a first-order approximation directly tied to discrete harmonic functions. This would in a sense be an analogue to the continuous case, where an asymptotic heat kernel expansion allows for a very similar representation.Furthermore, unlike in the continuous case, the computation of discrete polyharmonic functions in cones has, to the author’s knowledge, not been studied before. These two topics will form the main part of this thesis. After introducing some basic notions and going through some technical prerequisites in Chapters 1 and 2, it will be shown in Chapter 3 how one can construct a basis of the space of all discrete polyharmonic functions. This will be done in two ways; one of them arguably more straightforward and purely algebraicin nature, which works in any case and leads to a basis consisting of functions with algebraic generating function. The downside to this basis, however, is that the functions therein does not allow for a scaling limit, and that they do not allow an easy representation of the polyharmonic functions appearing in the asymptotics of lattice paths in the quarter plane. The second method uses decoupling functions and allows us to construct discrete polyharmonicfunctions for all finite group models. If the correlation coefficient is an integer fraction of p, then the resulting functions will even have rational generating functions of a rather nice shape.In Chapters 4 and 5, the question about the form of asymptotics of the number of lattice paths in the quarter plane will be addressed. For so-called orbit-summable models, which exhibit a remarkable algebraic property tied to their reflection group, we will see in Chapter 4 using a saddle point method that one can indeed find an asymptotic expansion.In Chapter 5, a class of infinite group models is treated, using a parametrization of the kernel curve via Jacobi ?-functions. Perhaps surprisingly, it turns outthat in this case the asymptotic expansion is somewhat more complicated, including logarithmic terms. Nonetheless, the dependency on the endpoint is still given by discrete polyharmonic functions.
en
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
polyharmonische Funktionen
de
dc.subject
erzeugende Funktionen
de
dc.subject
Gitterpunkspfade
de
dc.subject
polyharmonic functions
en
dc.subject
generating funcitions
en
dc.subject
lattice paths
en
dc.title
Discrete polyharmonic functions and their applications in combinatorics
en
dc.title.alternative
Diskrete polyharmonische Funktionen und ihre Anwendungen in der Kombinatorik
de
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.2023.98662
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Andreas Nessmann
-
dc.publisher.place
Wien
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
tuw.thesisinformation
Université de Tours
-
tuw.publication.orgunit
E104 - Institut für Diskrete Mathematik und Geometrie
-
dc.type.qualificationlevel
Doctoral
-
dc.identifier.libraryid
AC17032332
-
dc.description.numberOfPages
147
-
dc.thesistype
Dissertation
de
dc.thesistype
Dissertation
en
dc.rights.identifier
In Copyright
en
dc.rights.identifier
Urheberrechtsschutz
de
tuw.advisor.staffStatus
staff
-
item.languageiso639-1
en
-
item.openairetype
doctoral thesis
-
item.openairecristype
http://purl.org/coar/resource_type/c_db06
-
item.grantfulltext
open
-
item.cerifentitytype
Publications
-
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