• Register
PhysicsOverflow is a next-generation academic platform for physicists and astronomers, including a community peer review system and a postgraduate-level discussion forum analogous to MathOverflow.

Welcome to PhysicsOverflow! PhysicsOverflow is an open platform for community peer review and graduate-level Physics discussion.

Please help promote PhysicsOverflow ads elsewhere if you like it.


PO is now at the Physics Department of Bielefeld University!

New printer friendly PO pages!

Migration to Bielefeld University was successful!

Please vote for this year's PhysicsOverflow ads!

Please do help out in categorising submissions. Submit a paper to PhysicsOverflow!

... see more

Tools for paper authors

Submit paper
Claim Paper Authorship

Tools for SE users

Search User
Reclaim SE Account
Request Account Merger
Nativise imported posts
Claim post (deleted users)
Import SE post

Users whose questions have been imported from Physics Stack Exchange, Theoretical Physics Stack Exchange, or any other Stack Exchange site are kindly requested to reclaim their account and not to register as a new user.

Public \(\beta\) tools

Report a bug with a feature
Request a new functionality
404 page design
Send feedback


(propose a free ad)

Site Statistics

205 submissions , 163 unreviewed
5,047 questions , 2,200 unanswered
5,345 answers , 22,709 comments
1,470 users with positive rep
816 active unimported users
More ...

  Self-avoiding Walk with next-nearest neighbors

+ 3 like - 0 dislike


I study polymer physics and am doing experiments testing the model outlined in this paper. Basically, the polymers fall into an integer number of pits, and we create a partition function based on the number as the parameter. The multiplicity of each number-state is based on the number of non-degenerate self-avoiding random walks, from this sequence.

The problem

I've noticed that some of the molecular conformations are not nearest-neighbor self avoiding walks, but include next-nearest-neighbor chains. I want to derive a theory based on next-nearest-neighbor self-avoiding walk, and I need to know the number of unique configurations with N steps. This paper outlines the total number of configurations for m nearest and n next-nearest neighbors, but includes degenerate configurations. I want to know the number of unique configurations for each m and n, not the total, but I can't seem to find it.

The relationship between total and unique for nearest neighbor is $N_{u}=\frac{N+4}{8}$, but that relationship doesn't apply to the next-nearest numbers (many appear to be 2 (mod 6)). Does anyone know how or where I can figure this out, short of drawing every possible configuration on graph paper?

This post imported from StackExchange MathOverflow at 2015-04-08 16:27 (UTC), posted by SE-user iorgfeflkd

asked Jan 22, 2011 in Theoretical Physics by iorgfeflkd (15 points) [ revision history ]
edited Apr 8, 2015 by Dilaton

Your answer

Please use answers only to (at least partly) answer questions. To comment, discuss, or ask for clarification, leave a comment instead.
To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL.
Please consult the FAQ for as to how to format your post.
This is the answer box; if you want to write a comment instead, please use the 'add comment' button.
Live preview (may slow down editor)   Preview
Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:
Then drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds).
Please complete the anti-spam verification

user contributions licensed under cc by-sa 3.0 with attribution required

Your rights