A Three-Dimensional SFT with Sparse Columns

2025-12-11

AI Summary

This work addresses the challenge of sparse-constrained modeling in high-dimensional symbolic dynamical systems. Specifically, it constructs— for the first time—a nontrivial three-dimensional subshift of finite type (SFT) whose ℤ-trace (i.e., all vertical columns) contains at most two nonzero symbols (2-sparsity), while exhibiting deterministic evolution along the ℤ-direction—equivalently realized as the spacetime diagram of a partial cellular automaton. Methodologically, the paper introduces a precise Wang cube-based encoding framework, instantiated over a binary alphabet, and integrates tools from subshift theory, Wang tiling, spacetime diagram modeling, and topological conjugacy analysis to guarantee both structural realizability and dynamical consistency. The result breaks a longstanding technical barrier in jointly enforcing high-dimensionality and column-wise sparsity constraints within SFTs, thereby establishing a novel paradigm for sparse computational models and deterministic high-dimensional dynamical systems.

Technology Category

• Cognitive Modeling & Cognitive Systems: Neural Spike Coding
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Web Mining and Content Analysis: Models for Web evolution
• Security and Privacy: Applications of cryptography

Abstract

We construct a nontrivial three-dimensional subshift of finite type whose projective $$-subdynamics, or $$-trace, is 2-sparse, meaning that there are at most two nonzero symbols in any vertical column. The subshift is deterministic in the direction of the subdynamics, so it is topologically conjugate to the set of spacetime diagrams of a partial cellular automaton. We also present a variant of the subshift that is defined by Wang cubes, and one whose alphabet is binary.

Problem

• Constructs a 3D subshift of finite type with sparse columns
• Ensures at most two nonzero symbols per vertical column
• Relates to partial cellular automata via topological conjugacy

Innovation

• 3D subshift with sparse column constraints
• Deterministic dynamics via partial cellular automaton
• Wang cubes and binary alphabet variants