Grid polygons from permutations and their enumeration by the kernel method

Details Grid polygons from permutations and their enumeration by the kernel method Grid polygons from permutations and their enumeration by the kernel method

2006-03-09

arxiv.org/abs/math/0603225v1

Mathematics

Combinatorics

18 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Grid polygons from permutations and their enumeration by the kernel method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Grid polygons from permutations and their enumeration by the kernel method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grid polygons from permutations and their enumeration by the kernel method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-711752