Exact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1088/1751-8113/40/49/003

We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices in low dimensions. By definition, these are sets of k disjoint paths whose union visits each lattice vertex exactly once. The well-known Hamiltonian circuits and walks appear as the special cases k=0 and k=1 respectively. In two dimensions, we enumerate chains on L x L square lattices up to L=12, walks up to L=17, and circuits up to L=20. Some results for three dimensions are also given. Using our data we extract several quantities of physical interest.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Exact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions 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 Exact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-616773

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.