To create and edit articles, please register and log-in

User Tools

    To create and edit articles, please register and log-in

Site Tools


Main Menu

Main menu
Click categories to expand


A-Z listingplugin-autotooltip__plain plugin-autotooltip_bigA-Z listing

This is an alphabetical index of all content pages.


Other categories

Utilities

Contacts
Register

Also see

Importance Ratings
News
Legal
Donate/Sponsor


Wikenigma supports:


Feeds etc
rss / xml feed
sitemap file
A-Z listing (archived)


Auto-Translate Site

Wikenigma - an Encyclopedia of Unknowns Wikenigma - an Encyclopedia of the Unknown

Self avoiding walks

In mathematics, a Self-Avoiding Walk (SAW) is a sequence of moves on a lattice (a lattice path) that does not visit the same point more than once. (see Wikipedia )

The question of how many possible n-step SAWs are available on any given lattice is an open problem. It's possible to calculate the upper and lower bounds for the number of walks :

[…] but still the only known way to get an exact tally is to actually trace out all the n-step walks and count them.

Source : American Scientist , Volume 86, Number 4, pages 314–319

For a recent study into a possible mathematical model, see : Theophilus Agama (2021) On a function modeling an l-step self avoiding walk, AKCE International Journal of Graphs and Combinatorics.


    Share this page :

Dear reader : Do you have any suggestions for the site's content?

Ideas for new topics, and suggested additions / corrections for old ones, are always welcome.

If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !


Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.

( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)

Automatic Translation

You are currently viewing an auto-translated version of Wikenigma

Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.

Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.

Show another (random) article

DOKUWIKI IMPLEMENTATION DESIGN BY UNIV.ORG.UK JANUARY 2022