The iterative procedure of removing “almost everything” from a triangle ultimately leading to the Sierpinski's gasket S is well-known. But what is in fact left when almost everything has been taken out? Using the Sir Pinski's game described by Schroeder [4], we identify two dual sets of invariant points in this exquisite game, and from these we identify points left over in Sierpinski gasket. Our discussion also shows that the chaos game does not generate the Sierpinski gasket. It generates an approximation or, at most, a subset of S
Graphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by con...
We relate the Sierpinski triangle and the game of Nim. We begin by defining both a new high-dimensio...
The descending motion of particles in a Sierpinski gasket subject to a branching process is examined...
The iterative procedure of removing “almost everything” from a triangle ultimately leading to the Si...
Big open problems in science and mathematics have a way of surprisingly showing up in simple puzzles...
The Sierpinski triangle also known as Sierpinski gasket is one of the most interesting and the simpl...
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamic...
AbstractWe prove for the Sierpinski Gasket (SG) an analogue of the fractal interpolation theorem of ...
We define a Markov chain on a discrete symbolic space corresponding to the Sierpinski gasket (SG) and...
AbstractWe present a topological characterization of the Sierpiński triangle. This answers question ...
This paper is about the beauty of fractals and the surprising con-nections between them. We will exp...
We study self-avoiding paths on the three-dimensional pre-Sierpinski gasket. We prove the existence ...
We study the extension problem on the Sierpinski Gasket (SG). In the first part we con-sider minimiz...
We construct an analogue of Sierpinski gasket in Lobachevskii plane by means of iterated function sy...
© 2017, Pleiades Publishing, Ltd. We construct an analogue of Sierpiński gasket in Lobachevskii plan...
Graphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by con...
We relate the Sierpinski triangle and the game of Nim. We begin by defining both a new high-dimensio...
The descending motion of particles in a Sierpinski gasket subject to a branching process is examined...
The iterative procedure of removing “almost everything” from a triangle ultimately leading to the Si...
Big open problems in science and mathematics have a way of surprisingly showing up in simple puzzles...
The Sierpinski triangle also known as Sierpinski gasket is one of the most interesting and the simpl...
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamic...
AbstractWe prove for the Sierpinski Gasket (SG) an analogue of the fractal interpolation theorem of ...
We define a Markov chain on a discrete symbolic space corresponding to the Sierpinski gasket (SG) and...
AbstractWe present a topological characterization of the Sierpiński triangle. This answers question ...
This paper is about the beauty of fractals and the surprising con-nections between them. We will exp...
We study self-avoiding paths on the three-dimensional pre-Sierpinski gasket. We prove the existence ...
We study the extension problem on the Sierpinski Gasket (SG). In the first part we con-sider minimiz...
We construct an analogue of Sierpinski gasket in Lobachevskii plane by means of iterated function sy...
© 2017, Pleiades Publishing, Ltd. We construct an analogue of Sierpiński gasket in Lobachevskii plan...
Graphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by con...
We relate the Sierpinski triangle and the game of Nim. We begin by defining both a new high-dimensio...
The descending motion of particles in a Sierpinski gasket subject to a branching process is examined...