Staircase polygons: moments of diagonal lengths and column heights

Simple item page
dc.creatorRichard, Christoph
dc.date2006-05-30
dc.date.accessioned2026-07-07T09:58:45Z
dc.date.available2026-07-07T09:58:45Z
dc.descriptionWe consider staircase polygons, counted by perimeter and sums of k-th powers of their diagonal lengths, k being a positive integer. We derive limit distributions for these parameters in the limit of large perimeter and compare the results to Monte-Carlo simulations of self-avoiding polygons. We also analyse staircase polygons, counted by width and sums of powers of their column heights, and we apply our methods to related models of directed walks.
dc.description24 pages, 7 figures; to appear in proceedings of Counting Complexity: An International Workshop On Statistical Mechanics And Combinatorics, 10-15 July 2005, Queensland, Australia
dc.identifierhttps://arxiv.org/abs/math-ph/0605076
dc.identifierhttp://arxiv.org/abs/math-ph/0605076
dc.identifierJ. Phys.: Conf. Ser. 42 (2006), 239-257
dc.identifierdoi:10.1088/1742-6596/42/1/022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167830
dc.subjectMathematical Physics
dc.titleStaircase polygons: moments of diagonal lengths and column heights
dc.typetext

Files

Collections

arXiv