New combinatorial proofs for enumeration problems and random anchored structures

Publikationstyp
Doctoral Thesis
Date Issued
2021
Sprache
English
Author(s)
Haupt, Alexander  orcid-logo
Advisor
Taraz, Anusch  
Referee
Srivastav, Anand  
Title Granting Institution
Technische Universität Hamburg
Place of Title Granting Institution
Hamburg
Examination Date
2021-09-21
Institut
Mathematik E-10  
TORE-DOI
10.15480/882.3952
TORE-URI
http://hdl.handle.net/11420/11138
Citation
Technische Universität Hamburg (2021)
This thesis is divided into four parts. We present a combinatorial proof of Selberg's integral formula, which answers a question posed by Stanley. In the second part we enumerate S-omino towers bijectively. We also calculate the generating function of row-convex k-omino towers. In the third part we enumerate walks a rook can move along on a chess board. Finally, we study a new probabilistic version of a combinatorial problem posed by Freedman.
Subjects
combinatorial proofs
bijective proofs
selbergs integral formula
domino towers
rook paths
anchored random structures
DDC Class
500: Naturwissenschaften
510: Mathematik
Lizenz
http://rightsstatements.org/vocab/InC/1.0/
Loading...
Thumbnail Image
Name

Haupt_Alexander_New-Combinatorial-Proofs-for-Enumeration-Problems-and-Random-Anchored-Structures.pdf

Size

946.78 KB

Format

Adobe PDF