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.info:eu-repo/semantics/publishedVersio
This paper is about the beauty of fractals and the surprising con-nections between them. We will exp...
Given any triangle, we may construct a new triangle by choosing vertices from the edges of the origi...
The core concept of fractals is the process of rearranging identical components that have a large am...
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...
We show that the s-dimensional packing measure P^{s}(S) of the Sierpinski gasket S, where s=((log3)/...
AbstractWe prove for the Sierpinski Gasket (SG) an analogue of the fractal interpolation theorem of ...
The Sierpinski triangle also known as Sierpinski gasket is one of the most interesting and the simpl...
Our goal is to study Pascal-Sierpinski gaskets, which are certain fractal sets defined in terms of di...
We consider the iterated function systems (IFSs) that consist of three general similitudes in the pl...
AbstractWe present a topological characterization of the Sierpiński triangle. This answers question ...
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamic...
A quantized version of the Sierpinski gasket is proposed, on purely topological grounds, as a C*-alg...
Funding: Leverhulme Trust (Grant Number(s): RPG-2016-194), Engineering and Physical Sciences Researc...
We advance the program of connections between final coalgebras as sources of circularity in mathemat...
This paper is about the beauty of fractals and the surprising con-nections between them. We will exp...
Given any triangle, we may construct a new triangle by choosing vertices from the edges of the origi...
The core concept of fractals is the process of rearranging identical components that have a large am...
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...
We show that the s-dimensional packing measure P^{s}(S) of the Sierpinski gasket S, where s=((log3)/...
AbstractWe prove for the Sierpinski Gasket (SG) an analogue of the fractal interpolation theorem of ...
The Sierpinski triangle also known as Sierpinski gasket is one of the most interesting and the simpl...
Our goal is to study Pascal-Sierpinski gaskets, which are certain fractal sets defined in terms of di...
We consider the iterated function systems (IFSs) that consist of three general similitudes in the pl...
AbstractWe present a topological characterization of the Sierpiński triangle. This answers question ...
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamic...
A quantized version of the Sierpinski gasket is proposed, on purely topological grounds, as a C*-alg...
Funding: Leverhulme Trust (Grant Number(s): RPG-2016-194), Engineering and Physical Sciences Researc...
We advance the program of connections between final coalgebras as sources of circularity in mathemat...
This paper is about the beauty of fractals and the surprising con-nections between them. We will exp...
Given any triangle, we may construct a new triangle by choosing vertices from the edges of the origi...
The core concept of fractals is the process of rearranging identical components that have a large am...