6,588 research outputs found
Automatic enumeration of regular objects
We describe a framework for systematic enumeration of families combinatorial
structures which possess a certain regularity. More precisely, we describe how
to obtain the differential equations satisfied by their generating series.
These differential equations are then used to determine the initial counting
sequence and for asymptotic analysis. The key tool is the scalar product for
symmetric functions and that this operation preserves D-finiteness.Comment: Corrected for readability; To appear in the Journal of Integer
Sequence
Rooted Spiral Trees on Hyper-cubical lattices
We study rooted spiral trees in 2,3 and 4 dimensions on a hyper cubical
lattice using exact enumeration and Monte-Carlo techniques. On the square
lattice, we also obtain exact lower bound of 1.93565 on the growth constant
. Series expansions give and on a square lattice. With Monte-Carlo simulations we get the
estimates as , and . These results
are numerical evidence against earlier proposed dimensional reduction by four
in this problem. In dimensions higher than two, the spiral constraint can be
implemented in two ways. In either case, our series expansion results do not
support the proposed dimensional reduction.Comment: replaced with published versio
Statistics of self-avoiding walks on randomly diluted lattice
A comprehensive numerical study of self-avoiding walks (SAW's) on randomly
diluted lattices in two and three dimensions is carried out. The critical
exponents and are calculated for various different occupation
probabilities, disorder configuration ensembles, and walk weighting schemes.
These results are analyzed and compared with those previously available.
Various subtleties in the calculation and definition of these exponents are
discussed. Precise numerical values are given for these exponents in most
cases, and many new properties are recognized for them.Comment: 34 pages (+ 12 figures), REVTEX 3.
- …