Iwan Jensen 2004 J. Phys. A: Math. Gen. 37 11521 doi:10.1088/0305-4470/37/48/001
Iwan Jensen
Show affiliationsWe calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, (4.82) and (3.122) lattices. The bound is found by Kesten's method of irreducible bridges. This involves using transfer-matrix techniques to exactly enumerate the number of bridges of a given span to very many steps. Upper bounds are obtained from recent exact enumeration data for the number of self-avoiding walks and compared to current best available upper bounds from other methods.
05.50.+q Lattice theory and statistics (Ising, Potts, etc.)
82B20 Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs
82B41 Random walks, random surfaces, lattice animals, etc. (See also 60G50, 82C41)
Issue 48 (3 December 2004)
Received 10 September 2004, in final form 8 October 2004
Published 17 November 2004
Iwan Jensen 2004 J. Phys. A: Math. Gen. 37 11521
Xiang-Yu Ge et al 2002 J. Phys. A: Math. Gen. 35 6197
O E Barndorff-Nielsen and R D Gill 2000 J. Phys. A: Math. Gen. 33 4481
Aparna Saxena et al 2003 J. Phys. D: Appl. Phys. 36 3168
A N F Aleixo and A B Balantekin 2007 J. Phys. A: Math. Theor. 40 3915
GeV from STAR
M J Horner (for the STAR Collaboration) 2007 J. Phys. G: Nucl. Part. Phys. 34 S995
Stefan Boettcher 1999 J. Phys. A: Math. Gen. 32 5201
Harm van der Heijden and Joost van der Mullen 2002 J. Phys. D: Appl. Phys. 35 2112
George Horton and Chris Dewdney 2004 J. Phys. A: Math. Gen. 37 11935
Yeong E Kim and Alexander L Zubarev 2005 J. Phys. B: At. Mol. Opt. Phys. 38 L243