2008/09/30 by Uwe Schwerdtfeger, Schwerdtfeger, Uwe
Computer Science · Mathematics · #05A15 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #math.CO #msc:05A15 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0809.5232
11 pages, 3 figures; 14 pages, 4 figures, improved exposition, additional figure; 23 pages, 12 figures, additional section and figures
openalex publication_date 2008/09/30 · arxiv created 2010/01/26 · arxiv updated 2010/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Prudent walks are self-avoiding walks on the square lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex is adjacent to the first one. More precisely, we give the half-perimeter generating functions of two subclasses of prudent polygons, which turn out to be algebraic and non-D-finite, respectively.