Search Results for ""
21 - 30 of 333 for Capacity DimensionSearch Results

In many cases, the Hausdorff dimension correctly describes the correction term for a resonator with fractal perimeter in Lorentz's conjecture. However, in general, the proper ...
The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...
D_(KY)=j+(sigma_1+...+sigma_j)/(|sigma_(j+1)|), (1) where sigma_1<=sigma_n are Lyapunov characteristic exponents and j is the largest integer for which ...
R^n is homeomorphic to R^m iff n=m. This theorem was first proved by Brouwer.
There are several versions of the Kaplan-Yorke conjecture, with many of the higher dimensional ones remaining unsettled. The original Kaplan-Yorke conjecture (Kaplan and ...
A measure nu of a strange attractor which allows the presence of chaos to be distinguished from random noise. It is related to the capacity dimension D and information ...
The two-dimensional map x_(n+1) = [x_n+nu(1+muy_n)+epsilonnumucos(2pix_n)] (mod 1) (1) y_(n+1) = e^(-Gamma)[y_n+epsiloncos(2pix_n)], (2) where mu=(1-e^(-Gamma))/Gamma (3) ...
The tetrix is the three-dimensional analog of the Sierpiński sieve illustrated above, also called the Sierpiński sponge or Sierpiński tetrahedron. The nth iteration of the ...
A fractal which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 1 0; 1 1 1; 0 1 0],1->[1 1 1; 1 1 1; 1 1 1]}. (1) The size ...
x_(n+1) = 2x_n (1) y_(n+1) = alphay_n+cos(4pix_n), (2) where x_n, y_n are computed mod 1 (Kaplan and Yorke 1979). The Kaplan-Yorke map with alpha=0.2 has correlation exponent ...

...