|
Search: id:A092381
|
|
|
| A092381 |
|
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by nine loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices. |
|
+0
1
|
|
| 1, 1, 47564380971, 185410909790, 5599434135148010392903, 81562945655108319592717, 2647122748975437613370942794822122
(list; graph; listen)
|
|
|
OFFSET
|
18,3
|
|
|
REFERENCES
|
Saibal Mitra and Bernard Nienhuis (2003), Osculating Random Walks on Cylinders, in Discrete Random Walks, DRW'03, Cyril Banderier and Christian Krattenthaler (eds.), Discrete Mathematics and Theoretical Computer Science Proceedings AC, pp. 259-264.
|
|
LINKS
|
Saibal Mitra and Bernard Nienhuis, Osculating Random Walks on Cylinders
|
|
FORMULA
|
Even n: Q(n, m)=C_{L/2-m}(n)+sum_{r=1}^{n/4-m/2}(-1)^{r}C_{n/2-m- 2r}(n)(frac{m+2r}{m+r}binom{m+r}{r}. Odd n: Q(n, m)=sum_{r=0}^{frac{(n-1)}{4}-frac{m}{2}}(-1)^{r}[C_{frac{(n-1)}{2}-m-2r}(n)-C_{frac{(n-1)}{2}-m-2r-1} (n)]binom{m+r}{r} where the c_{k}(n) are the absolute values of the coefficients of the characteristic polynomial of the n X n Pascal matrix P_{i, j}=Binom{i+j-2}{i-1}. The sequence is given by Q(n, 9)
|
|
CROSSREFS
|
Sequence in context: A112446 A003940 A003933 this_sequence A084482 A034654 A015401
Adjacent sequences: A092378 A092379 A092380 this_sequence A092382 A092383 A092384
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Saibal Mitra (smitra(AT)zonnet.nl), Mar 20 2004
|
|
|
Search completed in 0.002 seconds
|
