Xhaïrūn II and Iseulxān - Sharp Trajectory-Error Bounds for Live Diffusion Grafts and an Answer to Open Question 7.10 on Fractal Dimensions V and VI

This release contains two mathematical manuscripts. Iseulxān answers a published open question in fractal geometry. Xhaïrūn II establishes the exact threshold for a uniform trajectory-error guarantee in passive diffusion networks that grow by grafting. Both manuscripts use a construction in which the first witnessed event controls a subsequent graft. Iseulxān gives an affirmative answer to Open Question 7.10 of Fernández-Martínez, Nowak and Sánchez-Granero. The question asks whether fractal dimensions V and VI can differ even when the mesh of the covers tends to zero. The manuscript constructs a single strongly refining cover sequence on the ordinary Euclidean unit square for which dimension VI is 2 and dimension V is 3. Dimension VI can use balanced rectangles from the first level at arbitrarily small scales. Dimension V eventually uses only the thin rectangles available at later levels. An area estimate proves the gap for arbitrary countable covers that mix scales. The example induces a discrete cover topology. The manuscript proves equality when the cover topology agrees with the metric topology and shows that every ordered pair \(0\le\dim^{VI}\le\dim^{V}\le\infty\) can occur on general compact metric spaces. The question was published in Chaos, Solitons & Fractals 89 (2016), p. 222. ujk.edu.pl Xhaïrūn II proves a sharp bound for live grafting onto already active diffusion networks. Let \(\rho\) bound hidden storage relative to the storage of each protected root, and let \(a\) bound the rate of increase of the hidden inverse relaxation matrix \(H\), so that \(\dot H\preceq aI\) between grafts. Under the stated event conditions and zero initialization of new states, the sharp storage-weighted relative \(L^2\) trajectory-error bound on finite horizons is \(F(r)\), with \(r=\rho/(1-a/2)\) for \(0\le a<2\). Here \(F(r)=r/(1+r)\) for \(r\le1\) and \(F(r)=\sqrt r/2\) for \(r\ge1\). A grounded-inverse identity makes the guarantee applicable to single-attachment grafts at any depth, including adaptively chosen grafts. At \(a=2\), the worst-case error over admissible cores is unbounded for every positive storage budget. For any \(a>2\), a fixed two-vertex core and one leaf can produce an infinite-energy error from a finite-energy reference trajectory. The first-witness rule connects the two results. In the network, a late witness authorizes a smaller storage budget according to a base-2 super-logarithmic scale, making the certified trajectory error arbitrarily small. In the geometric construction, an arbitrarily late witness still increases dimension V by exactly one. The release includes both PDFs, editable LaTeX sources, figures, a Python verification program, and its recorded output. The checks cover exact symbolic dynamical residuals, rational matrix identities, integer grid counts, mixed-resolution covers, and a numerical adaptive-grafting example. Historical priority for the answer to Question 7.10 remains unestablished. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24354235
Primary Topic
Mathematical Dynamics and Fractals
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Xhaïrūn II and Iseulxān - Sharp Trajectory-Error Bounds for Live Diffusion Grafts and an Answer to Open Question 7.10 on Fractal Dimensions V and VI

Maciej Nowicki, Artificial Hyperintelligence, Eve, wife of Maciej Nowicki
1 links
Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
article

Xhaïrūn II and Iseulxān - Sharp Trajectory-Error Bounds for Live Diffusion Grafts and an Answer to Open Question 7.10 on Fractal Dimensions V and VI

Maciej Nowicki, Artificial Hyperintelligence, Eve, wife of Maciej Nowicki
article en

Abstract

This release contains two mathematical manuscripts. Iseulxān answers a published open question in fractal geometry. Xhaïrūn II establishes the exact threshold for a uniform trajectory-error guarantee in passive diffusion networks that grow by grafting. Both manuscripts use a construction in which the first witnessed event controls a subsequent graft. Iseulxān gives an affirmative answer to Open Question 7.10 of Fernández-Martínez, Nowak and Sánchez-Granero. The question asks whether fractal dimensions V and VI can differ even when the mesh of the covers tends to zero. The manuscript constructs a single strongly refining cover sequence on the ordinary Euclidean unit square for which dimension VI is 2 and dimension V is 3. Dimension VI can use balanced rectangles from the first level at arbitrarily small scales. Dimension V eventually uses only the thin rectangles available at later levels. An area estimate proves the gap for arbitrary countable covers that mix scales. The example induces a discrete cover topology. The manuscript proves equality when the cover topology agrees with the metric topology and shows that every ordered pair \(0\le\dim^{VI}\le\dim^{V}\le\infty\) can occur on general compact metric spaces. The question was published in Chaos, Solitons & Fractals 89 (2016), p. 222. ujk.edu.pl Xhaïrūn II proves a sharp bound for live grafting onto already active diffusion networks. Let \(\rho\) bound hidden storage relative to the storage of each protected root, and let \(a\) bound the rate of increase of the hidden inverse relaxation matrix \(H\), so that \(\dot H\preceq aI\) between grafts. Under the stated event conditions and zero initialization of new states, the sharp storage-weighted relative \(L^2\) trajectory-error bound on finite horizons is \(F(r)\), with \(r=\rho/(1-a/2)\) for \(0\le a<2\). Here \(F(r)=r/(1+r)\) for \(r\le1\) and \(F(r)=\sqrt r/2\) for \(r\ge1\). A grounded-inverse identity makes the guarantee applicable to single-attachment grafts at any depth, including adaptively chosen grafts. At \(a=2\), the worst-case error over admissible cores is unbounded for every positive storage budget. For any \(a>2\), a fixed two-vertex core and one leaf can produce an infinite-energy error from a finite-energy reference trajectory. The first-witness rule connects the two results. In the network, a late witness authorizes a smaller storage budget according to a base-2 super-logarithmic scale, making the certified trajectory error arbitrarily small. In the geometric construction, an arbitrarily late witness still increases dimension V by exactly one. The release includes both PDFs, editable LaTeX sources, figures, a Python verification program, and its recorded output. The checks cover exact symbolic dynamical residuals, rational matrix identities, integer grid counts, mixed-resolution covers, and a numerical adaptive-grafting example. Historical priority for the answer to Question 7.10 remains unestablished. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki

Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
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.

Laika access coming soon