6,897 research outputs found
A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
Cellular automata (CAs) are dynamical systems which exhibit complex global
behavior from simple local interaction and computation. Since the inception of
cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention
of several researchers over various backgrounds and fields for modelling
different physical, natural as well as real-life phenomena. Classically, CAs
are uniform. However, non-uniformity has also been introduced in update
pattern, lattice structure, neighborhood dependency and local rule. In this
survey, we tour to the various types of CAs introduced till date, the different
characterization tools, the global behaviors of CAs, like universality,
reversibility, dynamics etc. Special attention is given to non-uniformity in
CAs and especially to non-uniform elementary CAs, which have been very useful
in solving several real-life problems.Comment: 43 pages; Under review in Natural Computin
Chromatic Polynomials for Strip Graphs and their Asymptotic Limits
We calculate the chromatic polynomials for -vertex strip graphs of the
form , where and are various subgraphs on the
left and right ends of the strip, whose bulk is comprised of -fold
repetitions of a subgraph . The strips have free boundary conditions in the
longitudinal direction and free or periodic boundary conditions in the
transverse direction. This extends our earlier calculations for strip graphs of
the form . We use a generating function method. From
these results we compute the asymptotic limiting function ; for this has physical significance as
the ground state degeneracy per site (exponent of the ground state entropy) of
the -state Potts antiferromagnet on the given strip. In the complex
plane, is an analytic function except on a certain continuous locus . In contrast to the strip graphs, where
(i) is independent of , and (ii) consists of arcs and possible line segments
that do not enclose any regions in the plane, we find that for some
strip graphs, (i) does depend on and
, and (ii) can enclose regions in the plane. Our study elucidates the
effects of different end subgraphs and and of boundary conditions on
the infinite-length limit of the strip graphs.Comment: 33 pages, Latex, 7 encapsulated postscript figures, Physica A, in
press, with some typos fixe
Chromatic Polynomials for Families of Strip Graphs and their Asymptotic Limits
We calculate the chromatic polynomials and, from these, the
asymptotic limiting functions
for families of -vertex graphs comprised of repeated subgraphs
adjoined to an initial graph . These calculations of for
infinitely long strips of varying widths yield important insights into
properties of for two-dimensional lattices . In turn,
these results connect with statistical mechanics, since is the
ground state degeneracy of the -state Potts model on the lattice .
For our calculations, we develop and use a generating function method, which
enables us to determine both the chromatic polynomials of finite strip graphs
and the resultant function in the limit . From
this, we obtain the exact continuous locus of points where
is nonanalytic in the complex plane. This locus is shown to
consist of arcs which do not separate the plane into disconnected regions.
Zeros of chromatic polynomials are computed for finite strips and compared with
the exact locus of singularities . We find that as the width of the
infinitely long strips is increased, the arcs comprising elongate
and move toward each other, which enables one to understand the origin of
closed regions that result for the (infinite) 2D lattice.Comment: 48 pages, Latex, 12 encapsulated postscript figures, to appear in
Physica
- …