71,605 research outputs found
Absence of orbital-selective Mott transition in Ca_2-xSr_xRuO4
Quasi-particle spectra of the layer perovskite SrRuO are calculated
within Dynamical Mean Field Theory for increasing values of the on-site Coulomb
energy . At small the planar geometry splits the bands near
into a wide, two-dimensional band and two narrow, nearly
one-dimensional bands. At larger , however, the spectral
distribution of these states exhibit similar correlation features, suggesting a
common metal-insulator transition for all bands at the same critical
.Comment: 4 pages, 4 figure
Honeycomb lattice polygons and walks as a test of series analysis techniques
We have calculated long series expansions for self-avoiding walks and
polygons on the honeycomb lattice, including series for metric properties such
as mean-squared radius of gyration as well as series for moments of the
area-distribution for polygons. Analysis of the series yields accurate
estimates for the connective constant, critical exponents and amplitudes of
honeycomb self-avoiding walks and polygons. The results from the numerical
analysis agree to a high degree of accuracy with theoretical predictions for
these quantities.Comment: 16 pages, 9 figures, jpconf style files. Presented at the conference
"Counting Complexity: An international workshop on statistical mechanics and
combinatorics." In celebration of Prof. Tony Guttmann's 60th birthda
Self-avoiding walks and polygons on the triangular lattice
We use new algorithms, based on the finite lattice method of series
expansion, to extend the enumeration of self-avoiding walks and polygons on the
triangular lattice to length 40 and 60, respectively. For self-avoiding walks
to length 40 we also calculate series for the metric properties of mean-square
end-to-end distance, mean-square radius of gyration and the mean-square
distance of a monomer from the end points. For self-avoiding polygons to length
58 we calculate series for the mean-square radius of gyration and the first 10
moments of the area. Analysis of the series yields accurate estimates for the
connective constant of triangular self-avoiding walks, ,
and confirms to a high degree of accuracy several theoretical predictions for
universal critical exponents and amplitude combinations.Comment: 24 pages, 6 figure
Comment on `Series expansions from the corner transfer matrix renormalization group method: the hard-squares model'
Earlier this year Chan extended the low-density series for the hard-squares
partition function to 92 terms. Here we analyse this extended
series focusing on the behaviour at the dominant singularity which lies
on on the negative fugacity axis. We find that the series has a confluent
singularity of order 2 at with exponents and
. We thus confirm that the exponent has the exact
value as observed by Dhar.Comment: 5 pages, 1 figure, IoP macros. Expanded second and final versio
A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice
We present a new and more efficient implementation of transfer-matrix methods
for exact enumerations of lattice objects. The new method is illustrated by an
application to the enumeration of self-avoiding polygons on the square lattice.
A detailed comparison with the previous best algorithm shows significant
improvement in the running time of the algorithm. The new algorithm is used to
extend the enumeration of polygons to length 130 from the previous record of
110.Comment: 17 pages, 8 figures, IoP style file
A numerical adaptation of SAW identities from the honeycomb to other 2D lattices
Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by
Nienhuis that the connective constant of self-avoiding walks on the honeycomb
lattice is A key identity used in that proof depends on
the existence of a parafermionic observable for self-avoiding walks on the
honeycomb lattice. Despite the absence of a corresponding observable for SAW on
the square and triangular lattices, we show that in the limit of large
lattices, some of the consequences observed on the honeycomb lattice persist on
other lattices. This permits the accurate estimation, though not an exact
evaluation, of certain critical amplitudes, as well as critical points, for
these lattices. For the honeycomb lattice an exact amplitude for loops is
proved.Comment: 21 pages, 7 figures. Changes in v2: Improved numerical analysis,
giving greater precision. Explanation of why we observe what we do. Extra
reference
Enumeration of self-avoiding walks on the square lattice
We describe a new algorithm for the enumeration of self-avoiding walks on the
square lattice. Using up to 128 processors on a HP Alpha server cluster we have
enumerated the number of self-avoiding walks on the square lattice to length
71. Series for the metric properties of mean-square end-to-end distance,
mean-square radius of gyration and mean-square distance of monomers from the
end points have been derived to length 59. Analysis of the resulting series
yields accurate estimates of the critical exponents and
confirming predictions of their exact values. Likewise we obtain accurate
amplitude estimates yielding precise values for certain universal amplitude
combinations. Finally we report on an analysis giving compelling evidence that
the leading non-analytic correction-to-scaling exponent .Comment: 24 pages, 6 figure
Low-density series expansions for directed percolation II: The square lattice with a wall
A new algorithm for the derivation of low-density expansions has been used to
greatly extend the series for moments of the pair-connectedness on the directed
square lattice near an impenetrable wall. Analysis of the series yields very
accurate estimates for the critical point and exponents. In particular, the
estimate for the exponent characterizing the average cluster length near the
wall, , appears to exclude the conjecture . The
critical point and the exponents and have the
same values as for the bulk problem.Comment: 8 pages, 1 figur
- …