Hamiltonian cycles on random lattices of arbitrary genus

dc.creatorHiguchi, Saburo
dc.date1998-06-29
dc.date1998-11-20
dc.date.accessioned2026-07-07T03:10:56Z
dc.date.available2026-07-07T03:10:56Z
dc.descriptionA Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It has been difficult to count the number of Hamiltonian cycles on regular lattices with periodic boundary conditions, e.g. lattices on a torus, due to the presence of winding modes. In this paper, the exact number of Hamiltonian cycles on a random trivalent fat graph drawn faithfully on a torus is obtained. This result is further extended to the case of random graphs drawn on surfaces of an arbitrary genus. The conformational exponent gamma is found to depend on the genus linearly.
dc.description16 pages, 4 figures, latex2e, uses graphicx and amsfonts. minor corrections
dc.identifierhttps://arxiv.org/abs/cond-mat/9806349
dc.identifierhttp://arxiv.org/abs/cond-mat/9806349
dc.identifierNucl.Phys. B540 (1999) 731-741
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/28394
dc.subjectStatistical Mechanics
dc.subjectSoft Condensed Matter
dc.subjectHigh Energy Physics - Lattice
dc.subjectHigh Energy Physics - Theory
dc.titleHamiltonian cycles on random lattices of arbitrary genus
dc.typetext

Files

Collections