Grid polygons from permutations and their enumeration by the kernel method

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
18 pages, 2 figures

Keywords

Combinatorics, Quantum Physics, 05A05; 05A15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/127666

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0603225
 http://arxiv.org/abs/math/0603225

Collections

arXiv