Peer-reviewed papers accepted by the Institute for Complexity Science and Advanced Computing.https://icsacinstitute.org/en-ushttps://icsacinstitute.org/publications/the-dynamic-existence-threshold/https://icsacinstitute.org/publications/the-dynamic-existence-threshold/What do market crashes, geomagnetic storms, and the loss of consciousness have in common? They are all moments when a system's organizational identity dissolves. This paper introduces a framework that makes that dissolution measurable, predictable, and universal. The Dynamic Existence Threshold (DET) provides a single coordinate system — the integration-differentiation balance zone — in which conscious brains, stable markets, and quiet magnetospheres all occupy the same region. Departure from this zone is organizational dissolution: the system persists physically but loses the coordinated struSun, 19 Apr 2026 00:00:00 GMTNathan M. Thornhillhttps://icsacinstitute.org/publications/the-existence-threshold/https://icsacinstitute.org/publications/the-existence-threshold/The Existence Threshold proposes a universal framework for understanding pattern persistence across binary discrete dynamical systems through the corrected formula Φ = R·S + D, representing a fundamental revision where disorder functions as a component of existence rather than its enemy. This version includes comprehensive experimental validation achieving perfect classification accuracy across ten cellular automata systems including Conway's Game of Life, Seeds, Day and Night, HighLife, and multiple one-dimensional and two-dimensional rule systems. Statistical analysis demonstrates nine of teSun, 19 Apr 2026 00:00:00 GMTNathan M. Thornhillhttps://icsacinstitute.org/publications/pattern-loss-at-dimensional-boundaries/https://icsacinstitute.org/publications/pattern-loss-at-dimensional-boundaries/Information degrades predictably when crossing dimensional boundaries—from DNA’s 1D code building 3D proteins to neural networks transforming data across dimensional spaces—yet this fundamental cost has never been quantified. While the “curse of dimensionality” describes problems qualitatively and dimensionality reduction techniques project high-dimensional data to lower dimensions, no prior work has measured information loss during the embedding of discrete patterns from dimension N to dimension N + 1.This study introduces the Φ metric (Φ = R · S + D), which decomposes pattern information intSun, 19 Apr 2026 00:00:00 GMTNathan M. Thornhillhttps://icsacinstitute.org/publications/the-dimensional-loss-theorem/https://icsacinstitute.org/publications/the-dimensional-loss-theorem/This paper presents the formalization and empirical validation of the Dimensional Loss Theorem, a universal principle governing the degradation of binary discrete patterns when embedded from 2D planes into 3D lattice volumes. Building upon prior empirical observations of an 86% scaling law, component-wise proofs are provided for the S (Connectivity), R (Volumetric), and D (Entropy) transformations. The connectivity tax is demonstrated to be a geometric invariant of Moore neighborhoods. Applying this framework to the final layers of GPT-2 and Gemma-2, numerical verification confirms exact compoSun, 19 Apr 2026 00:00:00 GMTNathan M. Thornhill