pith. sign in

arxiv: 0809.5232 · v3 · submitted 2008-09-30 · 🧮 math.CO

Exact solution of two classes of prudent polygons

classification 🧮 math.CO
keywords prudentpolygonswalksvertexadjacentalgebraicalreadycalled
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.