Self-assembly of the discrete Sierpinski carpet and related fractals

Details Self-assembly of the discrete Sierpinski carpet and related fractals Self-assembly of the discrete Sierpinski carpet and related fractals

2009-01-21

arxiv.org/abs/0901.3189v1

Computer Science

Other Computer Science

Scientific paper

It is well known that the discrete Sierpinski triangle can be defined as the nonzero residues modulo 2 of Pascal's triangle, and that from this definition one can easily construct a tileset with which the discrete Sierpinski triangle self-assembles in Winfree's tile assembly model. In this paper we introduce an infinite class of discrete self-similar fractals that are defined by the residues modulo a prime p of the entries in a two-dimensional matrix obtained from a simple recursive equation. We prove that every fractal in this class self-assembles using a uniformly constructed tileset. As a special case we show that the discrete Sierpinski carpet self-assembles using a set of 30 tiles.

Affiliated with

Also associated with

No associations

Rating

Self-assembly of the discrete Sierpinski carpet and related fractals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-assembly of the discrete Sierpinski carpet and related fractals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-assembly of the discrete Sierpinski carpet and related fractals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684114