Skip to content
#edge computing Open access

The Universal Aperture Transport System Topological Architecture, Hexadecimal Space, and the Computational Inversion of Matter

Aug 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

The Universal Aperture Transport System Topological Architecture, Hexadecimal Space, and the Computational Inversion of Matter Driven by Dean A. Kulik September 2026 1. The Compiling of Reality and the Table of Precedent In the prevailing paradigms of theoretical physics, information theory, and computational ontology, space is treated as an inert geometric container, mathematical law is viewed as an external descriptive tool, and physical matter is assumed to hold intrinsic values. A rigorous synthesis of discrete topology, contact Hamiltonian geometry, and recursive harmonic frameworks demands a total ontological inversion. The universe is not a container of objects that happen to possess surfaces. The universe is comprised of surfaces, and the interior object is a cognitive inference constructed from accumulated boundaries. The framework operates identically to compiled software. Reality must compile, and to compile it must follow a hierarchical table of precedent. Logic precedes transformation. Transformation generates shape. Shape dictates admissible mathematics. Mathematics resolves into phase-dependent values. Mathematics is not an intrinsic property of the void, nor a descriptive abstraction invented by observers. Mathematics is the emergent phenomenon of contact. It occurs at topological boundaries, identically to how friction occurs at physical boundaries, and it is the event of reality touching itself. The dual wave of this dual existence dictates that transformations always already exist. Wood is transformed into a table, the table provides lift, the lift changes spatial dimensions, and the chain of morphogenic evolution propagates without limit. These are not independent objects sequentially occupying a void. They are a singular transformation continuum in which matter is the halting condition of the topological fold. The ordering is strict, and it runs in one direction: LOGIC -> TRANSFORMATION -> SHAPE -> ADMISSIBLE MATHEMATICS -> VALUE The investigation runs the other way. A value is given; the work is to recover the formula that renders it, the relation the formula requires, the boundary that supplies the relation, and the transformation that produced the boundary. That reverse traversal is de-compilation, and it is the method of this report. 2. The Logic of Distinction: Spencer-Brown and the Unmarked State 2.1 The Foundational Mark The table of precedent begins below the level of mathematics, in the pure logic of distinction. In Laws of Form, George Spencer-Brown demonstrated that the root of all formal structure is the act of cleaving a space. The primary injunction is: draw a distinction. The mark separates a space into two states, generating an inside and an outside. Prior to the mark there is only the unmarked state, denoted here C0. C0 is not empty space, physical vacuum, or zero matter. C0 is absolute symmetry devoid of relational distinction. Within it there is no address system, no linear ordering, no distance, and no operator, because an address requires a distinguished reference and introducing one is already a transformation that breaks the symmetry. Distinction is the transcendental condition under which indication becomes possible; every system, however elaborate, rests on the residue of that first bifurcation. 2.2 Calling, Crossing, and Re-Entry Spencer-Brown's primary arithmetic establishes that a distinction persists unless an operation changes it, under two axioms. The Law of Calling: calling a state twice is indistinguishable from calling it once. The Law of Crossing: crossing a boundary twice restores the original state, which places an oscillatory behaviour at the foundation of logical space. This leads directly to re-entry, where a system is reintroduced into itself. Algebraically it is the self-referential form x = a + b/x, which unfolds into an infinite continued fraction. The imaginary unit is defined by the same move, i = −1/i, and it names a process alternating perpetually between states rather than a static value. The universe uses re-entry to sustain continuous transformation. Infinite objects do not exist; finite boundaries supporting processes that continue without limit do. 3. The Spherical Inversion: The Single Value Is Inside 3.1 The Geometry of C0 Interrogating the geometric form of C0 — the first structure capable of existing without importing an external distinction — yields the sphere. The sphere carries maximal symmetry, SO(3) acting transitively on its surface, and it is the only topology with zero privileged locations. Every point on an unmarked sphere is equivalent to every other, so the sphere supplies no information with which to distinguish a coordinate. The sphere is the only entity possessing exactly one formula and a single value, and that value exists exclusively on the inside. This is not a stylistic emphasis; it is forced. Jordan-Brouwer separation, requiring no mark, guarantees that a closed surface produces exactly two regions and that one of them is bounded. Bounded means finite extent. Finite extent means a scale exists on that side and nowhere else. That scale is r, and the closure measure C = 2πr relates it to the boundary's aggregate extent. Neither requires an origin on the surface and neither requires a direction, which is precisely why both are available before any mark is made. The outside is mathematically nothing. It is unbounded, it carries no intrinsic metric, and it cannot return a value. Everything sayable about it is a statement about the boundary phrased negatively. It follows that there is no matter there either: matter is the bounded region together with the boundary that closes it, and the exterior is where that matter is not. Matter is strictly shape, and all complex mathematics is an emergent property of that shape constraining the transformation field. 3.2 The Admissibility Filter This establishes the primary rule of the ontological compiler: shape is a strict constraint on mathematics. The sphere's perfect symmetry filters out addressable mathematics and leaves only the logic of continuation and closure. The demarcation is between mathematics forced by intrinsic topology and mathematics restricted until a mark is introduced. Shape Forced by intrinsic topology (M⁺) Requires a mark to compile (M⁻) Point coincidence, identity distance, integrals, gradients Line distance |x₂ − x₁|, one-dimensional integrals area, cross product, perpendicular Circle rotational closure θ + 2π ≡ θ canonical zero, linear order without a cut Sphere closure, r, C = 2πr, A = 4πR², κ = 1/R θ and φ, global chart, flat derivative ∂ₓ The distinction between the two columns is the machinery of the entire framework and it must not be collapsed. It is tempting to argue that C0 being math-free means the sphere has no r and no 2πr either. That argument destroys the table. The correct statement is narrower and stronger: the sphere refuses addressable mathematics, not all mathematics. It has no canonical origin, no global Cartesian chart, and no intrinsic angular coordinate — latitude and longitude necessarily fail at the poles, which is the shape physically demonstrating what it declines to supply. What it does have is one scale and one closure relation, and both are interior. 3.3 The Deficit as Measure The claim that the sphere admits the least mathematics has an exact quantitative form, and it is a classical theorem. The isoperimetric inequality states that for any body A³ ≥ 36πV², with equality if and only if the body is a sphere. Normalised as a deficit: delta(K) = A(K)^3 / (36 pi V(K)^2) - 1 >= 0, = 0 iff sphere Read conventionally this says the sphere is efficient. Read under the inversion it says the sphere is the unique zero of mathematical content, because boundary is where mathematics is and the sphere minimises boundary per unit of being. Departure from sphericity is mathematical content, exactly and computably. Body δ Sphere 0.000000 Regular icosahedron 0.206567 Regular dodecahedron 0.325034 Cylinder, h = 2r 0.500000 Regular octahedron 0.653987 Cube 0.909859 Cone, h = 2r 1.118034 Regular tetrahedron 2.307973 Torus, R = 3r 3.188790 Cylinder, h = 20r 4.145000 The Platonic solids order by descending face count, because fewer faces forces each to be larger and flatter and flatness is departure from the sphere. Elongation costs more than faceting. A discrete companion measure counts aperture sites: the sphere has one face, no edges and no vertices, giving a single site, where the cube has twenty-six and the icosahedron sixty-two. Euler's V − E + F = 2 holds across all of them, so the topological invariant is identical and the site count is not — two bodies of the same topology admit vastly different amounts of mathematics according to how their boundary has been divided. The same property produces both results. The sphere has no flat region, which minimises its boundary, and it is also why the sphere is the only convex body whose contact with any other convex body is generically a single point. Minimum boundary and minimum aperture are one property read at two scales. 4. Jordan-Brouwer Separation and Topological Bifurcation 4.1 Unprompted Bifurcation While an unmarked sphere refuses addressable coordinates, its existence as a closed manifold forces a physical reality into being with no mark required. The Jordan-Brouwer separation theorem, generalising the planar Jordan curve theorem, states that any topological (n−1)-sphere embedded in n-dimensional Euclidean space divides the complement into exactly two disjoint connected components — one bounded, one unbounded — with the surface as their single common boundary. For a sphere embedded in three-space this guarantees absolute bifurcation. It is a zero-mark compile eve

View source

Similar papers

AoI Minimization in Heterogeneous MEC Networks: A Federated Learning-Assisted Hybrid DRL and Convex Approach

This paper investigates a dynamic heterogeneous mobile edge computing network (HMECN), where mobile devices (MDs) could offload their full tasks to a small base station (SBS) directly or the macro base station (MBS) in direct or relay mode. As age of information (AoI) is a comprehensive and accurate metric to capture the freshness of computation results, we formulate a long-term weighted sum AoI (LWSA) minimization problem in the HMECN by jointly optimizing the offloading decisions of MDs as well as the bandwidth and computation resource allocation of all base stations, subject to energy, delay and peak AoI constraints. To address the formulated non-convex mixed integer nonlinear programming problem, we decompose it into the offloading decision optimization (ODO) top-problem and the resource allocation optimization (RAO) sub-problem. Based on the decomposition, we propose a federated learning (FL)-assisted hybrid DRL and convex approach that is comprised of a safe multi-agent DRL algorithm, convex optimization and FL. The ODO top-problem is solved by the safe multi-agent DRL algorithm, which strictly ensures that the actions of each agent do not exceed its energy constraint and then paves the way for using convex optimization to solve the RAO sub-problem. FL is used to alleviate the training instability problem aggravated by multi-agent settings via breaking the limitation of partial knowledge for each individual agent. Simulation results demonstrate the superiority of the proposed approach in terms of the LWSA, convergence, scalability and robustness in dynamic environments.

Xiaoying Liu, Junhao Zheng, Kechen Zheng et al. · 8 citations
#edge computing Sep 2026

DRUDM-CFG: A Fairness-Aware Multi-Agent DRL Algorithm for AMEC-Assisted Task Offloading in Post-Disaster Scenarios

High-altitude airships (HAS) and uncrewed aerial vehicles (UAVs) equipped with Multiaccess Edge Computing (MEC) servers have emerged as promising aerial MEC nodes for providing task offloading (TO) services to intelligent mobile devices (IMDs) in post-disaster scenarios. HAS offers robust computing and energy resources, while UAVs provide flexible, low-altitude coverage for rapid deployment. However, direct task offloading from IMDs to HAS often leads to task failures due to high transmission delays. UAVs with limited onboard resources require to minimize resource waste. Additionally, IMDs in sparse areas face insufficient TO services due to unfair UAV coverage. This paper defines these challenges as a joint optimization problem involving TO, RA, and UAV coverage fairness. It proposes a cooperative aerial Multiaccess Edge Computing (AMEC) framework integrating HAS and UAVs to address the issue. Within this framework, a hybrid TO scheme is first developed to mitigate the high transmission delay between IMDs and HAS. Second, a Distance, Resource, Urgency-based Decision Mechanism (DRUDM) is designed to enhance the accuracy of UAVs in selecting target IMDs for TO services. Third, a Coverage Fairness Guarantee (CFG) strategy is proposed to optimize UAV flight trajectories, ensuring IMDs in sparse areas receive fair TO services. Finally, the joint optimization problem is modeled as a Multi-Agent Partially Observable Markov Decision Process (MA-POMDP), and a DRUDM–CFG algorithm is presented to efficiently solve this complex non-convex optimization problem. Experimental results demonstrate that the proposed algorithm outperforms other compared algorithms in task completion rate and average delay, benefiting from the DRUDM mechanism. Meanwhile, the CFG strategy effectively improves TO service fairness for IMDs in sparse areas.

Xiting Peng, Chuanqi Qin, Xiaoyu Zhang et al. · 4 citations
#edge computing Preprint Aug 2026

Computing an e-net of a closed hyperbolic surface

Hyperbolic surfaces are a fundamental object in mathematics and play an increasingly important role in computational geometry and topology. A key ingredient in the design of efficient algorithms on such surfaces is the availability of a geometric discretization of controlled complexity. In this paper, we present the first algorithm for constructing e-nets on hyperbolic surfaces starting from a fundamental polygon representation. Our approach is based on Delaunay refinement and relies on maintaining Delaunay triangulations through edge flips. The size of an e-net cannot be bounded solely as a function of the genus because of the presence of arbitrarily long collars around short geodesics. To overcome this difficulty, we introduce the notion of a pseudo e-net, which decomposes the surface into e-thin cylinders together with a Delaunay triangulation over an e-net of the remaining thick part. As applications, we obtain algorithms for computing the length spectrum of an e-thick hyperbolic surface and for computing the systole from a pseudo log(sqrt(2))-net. These results demonstrate that Delaunay-based discretizations provide a practical and versatile framework for algorithmic computations on hyperbolic surfaces.

V. Delecroix, Vincent Despré, Camille Lanuel et al. · 3 citations
#edge computing Sep 2026

Toward 6G Edge Intelligence: Lightweight LLMs for Intent-Driven Network Automation

Future 6G networks are envisaged to tightly integrate communication, sensing, and computing, demanding real-time, intent-driven intelligence at the edge. While large language models (LLMs) excel in intent recognition and semantic reasoning, their application to real-time network lifecycle management at the edge is limited by heterogeneous application intents (APPIs), dynamic network conditions, and severe resource constraints. This paper proposes a novel lightweight LLM architecture, KGLlama-KD, that synergizes knowledge graphs (KGs) with knowledge distillation (KD) to enable intent-driven networking and enhance 6G edge intelligence. Specifically, a KG is constructed to formally describe the relationships among application scenarios, functional primitives, performance requirements within APPIs, and the correspondences between APPIs and network service requests (NSRs), thereby producing a structured intent training dataset. Building upon the Llama 3 foundation model, a two-phase optimization framework is designed to support lightweight edge deployment while preserving translation fidelity. The LLM is first fine-tuned with KG guidance and compressed via KD in the cloud, and then deployed on resource-constrained edge nodes to perform real-time, accurate, and efficient APPIs interpretation. Experiments validate that KGLlama-KD achieves 95% accuracy for APPI understanding, surpassing DeepSeek and Qwen by an average of 8%. The distilled model reduces inference latency by 60% compared to full-scale LLMs, fulfilling the sub-100 ms requirement for 6G latency-sensitive services.

Bing Wu, Sai Zou, Minghui Liwang et al. · 3 citations
#edge computing Sep 2026

Joint Latency and Charge Cost Minimization for Reliable Task Offloading in Dispersed Computing: A Multi-Objective Optimization Approach

Dispersed computing has emerged as a promising paradigm that leverages underutilized resources from massive Internet of Things devices (IoTDs) to enhance the computing capacity at the network edge. However, existing works about the dispersed computing overlook the heterogeneous computing environment with parallel and serial computations and task reliability requirements for the hardware-constrained IoTDs, and they lack multi-objective optimization approaches to optimize the task offloading. To address the challenges, we propose a comprehensive scheme to achieve a delay-aware and economic-aware dispersed computing paradigm by using a multi-objective optimization approach. Particularly, we consider parallel processing at an edge server and serial processing at the lightweight IoTDs, and leverage the task redundancy to satisfy the task reliability requirements on the IoTD side. We further formulate a constrained multi-objective optimization problem (CMOP) aiming at jointly optimizing the task assignment, bandwidth allocation, and CPU frequency allocation to simultaneously minimize the total delay cost and the total charge cost of the tasks. To address the CMOP, we propose an improved constrained multi-objective evolutionary algorithm that employs a dual-population cooperative mechanism between two populations and a repairing constraint-handling technique. The dual-population cooperative mechanism can balance convergence toward Pareto optimality and solution diversity maintenance. The repairing constraint-handling technique is designed to guide solutions toward feasible regions, achieving efficient exploration of complex constrained search spaces. Simulation results demonstrate the superiority of our algorithm in seeking the better-converged and better-distributed Pareto optimal solutions to well address the tradeoffs between the two objectives.

Xumin Huang, Zexiong Wu, Chaoda Peng et al. · 2 citations
#edge computing Sep 2026

Service Enhancement and Reliability Assurance in 6G Vehicular Networks via a Stackelberg Game-Theoretic Approach

With the rapid development of 6G and Internet of Vehicles (IoV) technologies, the volume of computation-intensive tasks generated by intelligent vehicles is growing exponentially. Given limited onboard processing capabilities, vehicles increasingly rely on edge servers deployed by service providers (SPs) at roadside units to offload tasks. Vehicle clients can offload the tasks to SPs to mitigate their onboard computation load, while SPs derive economic benefits through the provision of computation resources. However, this interaction introduces a conflict of interest, as vehicles aim to minimize their offloading costs, while SPs seek to maximize revenue. To address this problem, we propose SPOR, a Stackelberg game-based service priority-aware computation offloading and resource pricing scheme in IoV. SPOR is a hierarchical game-theoretic framework in which SPs act as leaders setting prices, while vehicles act as followers determining their offloading strategies. A novel service prioritization function is introduced, incorporating booking price, system load, and reputation to ensure fair and balanced resource allocation. We provide a theoretical proof of the existence and uniqueness of a Nash equilibrium. Extensive experiments on a real-world vehicle edge computing dataset show that SPOR outperforms baseline methods in delay, energy consumption, average load, and task completion rate. Notably, SPOR maintains task completion rates above 97% even under heavy workloads, demonstrating its effectiveness in enhancing system reliability and overall performance.

Kai Peng, Yuanlin Lin, Shuai Zhao et al. · 2 citations

Related blog posts