Grid polygons from permutations and their enumeration by the kernel method

Abstract

A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we enumerate sets of permutations whose consecutive-minima polygons satisfy specific geometric conditions. We deal with 2-variate and 3-variate generating functions involving derivatives, cases which are not routinely solved by the kernel method.