Grid polygons from permutations and their enumeration by the kernel method
组合数学
2007-05-23 v1 量子物理
摘要
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.
引用
@article{arxiv.math/0603225,
title = {Grid polygons from permutations and their enumeration by the kernel method},
author = {Toufik Mansour and Simone Severini},
journal= {arXiv preprint arXiv:math/0603225},
year = {2007}
}
备注
18 pages, 2 figures