The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.
Zeilberger, Doron
The Electronic Journal of Combinatorics [electronic only]
(2001)
- Volume: 8, Issue: 1, page Research paper R28, 17 p.-Research paper R28, 17 p.
- ISSN: 1077-8926
Zeilberger, Doron. "The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.." The Electronic Journal of Combinatorics [electronic only] 8.1 (2001): Research paper R28, 17 p.-Research paper R28, 17 p.. <http://eudml.org/doc/121226>.
@article{Zeilberger2001,
author = {Zeilberger, Doron},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {self-avoiding polygons; self-avoiding walks; umbral schemes; counting; polynomioes},
language = {eng},
number = {1},
pages = {Research paper R28, 17 p.-Research paper R28, 17 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.},
url = {http://eudml.org/doc/121226},
volume = {8},
year = {2001},
}
TY - JOUR
AU - Zeilberger, Doron
TI - The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2001
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 8
IS - 1
SP - Research paper R28, 17 p.
EP - Research paper R28, 17 p.
LA - eng
KW - self-avoiding polygons; self-avoiding walks; umbral schemes; counting; polynomioes
UR - http://eudml.org/doc/121226
ER -
You must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.