Degenerate Fractals: A Formal and Computational Framework for Zero-Dimension Attractors

This paper analyzes the extreme limit of iterated function systems (IFSs) when the number of contractions drops to one and the resulting attractors reduce to a single point. While classical fractals have a strictly positive fractal dimension, the degenerate case D=0 has been little explored. Starting from the question “what happens to a fractal when its complexity collapses completely?”, Moran’s similarity equation becomes tautological (rs=1 with solution s=dimM=0) and that only the Hausdorff and box-counting definitions allow an exact calculation. Based on Banach’s fixed point theorem and these definitions, we prove that the attractor of a degenerate IFS is a singleton with dimH=dimB=0. We develop a reproducible computational methodology to visualize the collapse in dimensions 1–3 (the Iterated Line Contraction—1D/Iterated Square Contraction—2D/Iterated Cube Contraction—3D families), including deterministic and stochastic variants, and we provide a Python script 3.9. The theoretical and numerical results show that the covering box-counting retains unity across all generations, confirming the zero-dimension element and the stability of the phenomenon under moderate perturbations. We conclude that degenerate fractals are an indispensable benchmark for validating fractal dimension estimators and for studying transitions to attractors with positive dimensions.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-10-26
DOI
https://doi.org/10.3390/math13213407
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Degenerate Fractals: A Formal and Computational Framework for Zero-Dimension Attractors

Ion Andronache
Mathematics
Neural Networks and Applications
article

Degenerate Fractals: A Formal and Computational Framework for Zero-Dimension Attractors

Ion Andronache
article en

Abstract

This paper analyzes the extreme limit of iterated function systems (IFSs) when the number of contractions drops to one and the resulting attractors reduce to a single point. While classical fractals have a strictly positive fractal dimension, the degenerate case D=0 has been little explored. Starting from the question “what happens to a fractal when its complexity collapses completely?”, Moran’s similarity equation becomes tautological (rs=1 with solution s=dimM=0) and that only the Hausdorff and box-counting definitions allow an exact calculation. Based on Banach’s fixed point theorem and these definitions, we prove that the attractor of a degenerate IFS is a singleton with dimH=dimB=0. We develop a reproducible computational methodology to visualize the collapse in dimensions 1–3 (the Iterated Line Contraction—1D/Iterated Square Contraction—2D/Iterated Cube Contraction—3D families), including deterministic and stochastic variants, and we provide a Python script 3.9. The theoretical and numerical results show that the covering box-counting retains unity across all generations, confirming the zero-dimension element and the stability of the phenomenon under moderate perturbations. We conclude that degenerate fractals are an indispensable benchmark for validating fractal dimension estimators and for studying transitions to attractors with positive dimensions.

MathematicsVol. 13(21)
Alexandru Ioan Cuza University (RO), Alma Mater Europaea (SI), Gheorghe Dima Music Academy (RO), University of Bacău (RO)
Openalex Percentile: Top 84%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.