|
Search: id:A092375
|
|
|
| A092375 |
|
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 three 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, 4707, 17576, 112088578, 1441214058, 17605459620761, 743370332504726, 19997068111196867031, 2689483333931146069897, 171415422163184300298223345, 71911782152540818802247981150
(list; graph; listen)
|
|
|
OFFSET
|
6,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, 3)
|
|
CROSSREFS
|
Sequence in context: A114542 A114568 A107544 this_sequence A093789 A083637 A083638
Adjacent sequences: A092372 A092373 A092374 this_sequence A092376 A092377 A092378
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Saibal Mitra (smitra(AT)zonnet.nl), Mar 20 2004
|
|
|
Search completed in 0.002 seconds
|
