A simple resummation method for cluster expansions
About this item
| Description: |
Zahradnik, M (Charles )
Wednesday 23 January 2008, 14:00-14:30 Zeros of Graph Polynomials |
|---|
| Created: | 2008-02-07 09:46 | ||
|---|---|---|---|
| Collection: | Combinatorics and Statistical Mechanics | ||
| Publisher: | Isaac Newton Institute | ||
| Copyright: | Zahradnik, M | ||
| Language: | eng (English) | ||
| Credits: |
|
||
| Abstract: | I will present a simple and (possibly) new method of organizing the (+/- cancellations in the) cluster expansions of polymer models, hard repulsion case. The method is suitable for models where polymers are "cycles" or closed paths in a lattice (Kramers-Wannier representation of the Ising model, perturbations of massless Gaussians) also in several cases where expansions are only nonabsolutely summable. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video * | 480x360 | 1.84 Mbits/sec | 451.42 MB | View | Download | |
| Flash Video | 480x360 | 805.29 kbits/sec | 192.97 MB | View | Download | |
| iPod Video | 480x360 | 505.17 kbits/sec | 121.05 MB | View | Download | |
| Windows Media Video (for download) | 480x360 | 477.77 kbits/sec | 114.49 MB | View | Download | |
| Windows Media Video (for streaming) | 480x360 | 445.85 kbits/sec | 106.84 MB | View | Download | Stream |
| RealMedia | 480x360 | 877.51 kbits/sec | 210.27 MB | View | Download | Stream |
| QuickTime (for download) | 384x288 | 848.17 kbits/sec | 203.24 MB | View | Download | |
| QuickTime (for streaming) | 480x360 | 907.08 kbits/sec | 217.36 MB | View | Download | |
| MP3 | 44100 Hz | 125.04 kbits/sec | 29.75 MB | Listen | Download | |
