A lower bound on TSRmH in the O(4) model on anisotropic lattices
β Scribed by R.V. Gavai; U.M. Heller; F. Karsch; T. Neuhaus; B. Plache
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 530 KB
- Volume
- 294
- Category
- Article
- ISSN
- 0370-2693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far,
Let P k n be the maximum value achieved by the permanent over k n , the set of (0, 1)-matrices of order n with exactly k ones in each row and column. Brègman proved that P k n k! n/k . It is shown here that P k n k! t r! where n = tk + r and 0 r < k. From this simple bound we derive that (P k n ) 1/