Grid polygons from permutations and their enumeration by the kernel method

Simple item page
dc.creatorMansour, Toufik
dc.creatorSeverini, Simone
dc.date2006-03-09
dc.date.accessioned2026-07-07T07:57:29Z
dc.date.available2026-07-07T07:57:29Z
dc.descriptionA 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.
dc.description18 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0603225
dc.identifierhttp://arxiv.org/abs/math/0603225
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127666
dc.subjectCombinatorics
dc.subjectQuantum Physics
dc.subject05A05; 05A15
dc.titleGrid polygons from permutations and their enumeration by the kernel method
dc.typetext

Files

Collections

arXiv