Combinatorial (or numerical) self-similarity is an apparently new concept, introduced here in an attempt to explain the similarity of properties of the members of a homologous series that are not (geometrically) self-similar and whence are not (deterministic) fractals. The term is defined in the following steps: a) Select a numerical invariant, ep, characteristic of the member of the series b) Partition this property, ep, into a finite number of parts through a prescribed algorithm c) Members are described so as to be combinatorially self-similar (or to represent a »numerical« fractal) if the limits of the ratios of ep of two successive members at infinite stages of homologation are equal for all parts, and equal the corresponding limit for...
Highly applied in machining, image compressing, network traffic prediction, biological dynamics, ner...
The term fractal was first coined by the Polish-born, French-American mathe- matician Benoît Mandelb...
AbstractThe number of matchings of a graph G is an important graph parameter in various contexts, no...
Combinatorial (or numerical) self-similarity is an apparently new concept, introduced here in an att...
Previously defined equivalence relation, l, on Kekulé counts, K(B)’s of catacondensed benzeno...
The self-similarity properties of fractals are studied in the framework of the theory of entire anal...
Branching trees and bushes are obtained from a segment by an infinite sequence of two elementary tra...
AbstractWe describe a general construction principle for a class of self-similar graphs. For various...
Abstract. Sets that consist of finitely many smaller-scale copies of itself are known as self-simila...
International audienceSelf-similarity of plants has attracted the attention of biologists for at lea...
AbstractIf an invertible postcritically finite self-similar set is simply connected, it is homeomorp...
Fractal is a set, which geometric pattern is self-similar at different scales. It has a fractal dime...
We define exact self-similarity of Space Filling Curves on the plane. For that purpose, we adapt the...
Defining the biperiodic Fibonacci words as a class of words over the alphabet {0,1}, and two special...
Self-similar sets are a class of fractals which can be rigorously defined and treated by mathematica...
Highly applied in machining, image compressing, network traffic prediction, biological dynamics, ner...
The term fractal was first coined by the Polish-born, French-American mathe- matician Benoît Mandelb...
AbstractThe number of matchings of a graph G is an important graph parameter in various contexts, no...
Combinatorial (or numerical) self-similarity is an apparently new concept, introduced here in an att...
Previously defined equivalence relation, l, on Kekulé counts, K(B)’s of catacondensed benzeno...
The self-similarity properties of fractals are studied in the framework of the theory of entire anal...
Branching trees and bushes are obtained from a segment by an infinite sequence of two elementary tra...
AbstractWe describe a general construction principle for a class of self-similar graphs. For various...
Abstract. Sets that consist of finitely many smaller-scale copies of itself are known as self-simila...
International audienceSelf-similarity of plants has attracted the attention of biologists for at lea...
AbstractIf an invertible postcritically finite self-similar set is simply connected, it is homeomorp...
Fractal is a set, which geometric pattern is self-similar at different scales. It has a fractal dime...
We define exact self-similarity of Space Filling Curves on the plane. For that purpose, we adapt the...
Defining the biperiodic Fibonacci words as a class of words over the alphabet {0,1}, and two special...
Self-similar sets are a class of fractals which can be rigorously defined and treated by mathematica...
Highly applied in machining, image compressing, network traffic prediction, biological dynamics, ner...
The term fractal was first coined by the Polish-born, French-American mathe- matician Benoît Mandelb...
AbstractThe number of matchings of a graph G is an important graph parameter in various contexts, no...