🔢 mathematics

Higher-Dimensional Symbolic Dynamics: A Textile Framework For 3-graphs

This paper extends the concept of textile systems to three dimensions to create a framework that captures all 3D shifts of finite type, establishes a correspondence with 3-graphs by encoding their structural conditions via pullback diagrams, and proves the homological consistency of the resulting 3D textile systems with their associated 3-graphs.

Original authors: Roozbeh Hazrat, Promit Mukherjee, Sujit Kumar Sardar

Published 2026-08-03

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Roozbeh Hazrat, Promit Mukherjee, Sujit Kumar Sardar

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a world where you can describe complex patterns not just by looking at a single line of dominoes, but by watching how they fall in a grid, or even a 3D block of them. This is the realm of symbolic dynamics, a branch of mathematics that studies how simple rules create complex, repeating patterns over time and space. Think of it like a giant, infinite puzzle where every piece must fit perfectly with its neighbors according to a strict set of instructions. In the simplest version, you have a one-dimensional line of tiles; in more advanced versions, you have a flat sheet (2D) or a solid cube (3D) of tiles.

To make sense of these patterns, mathematicians use two powerful tools. The first is shifts of finite type, which are just fancy names for these patterned grids where the rules are local (a tile only cares about its immediate neighbors). The second tool is higher-rank graphs, which look like tangled webs of roads where you can travel in multiple directions at once, but the roads must cross each other in a very specific, predictable way. For a long time, mathematicians had a brilliant way to connect these two tools for flat, 2D grids using something called textile systems. Imagine a textile system as a loom: it weaves together two different sets of rules (like horizontal and vertical threads) to create a fabric. If the loom is "left-resolving" (meaning the pattern is unique and doesn't get confused), the fabric it weaves perfectly matches the tangled road map of a 2-graph. But what happens when you try to weave a 3D cube? Does the same loom work? That is the big question this paper tackles.

The authors of this paper, Rozbeh Hazrat, Promit Mukherjee, and Sujit Kumar Sardar, set out to build a new kind of loom for three dimensions. They introduce a three-dimensional textile system, a mathematical structure that acts like a blueprint for weaving 3D patterns. Just as a 2D loom uses a pair of maps to weave a flat fabric, their 3D loom uses a complex diagram of four interconnected maps to weave a solid block of patterns. They prove that this new system is the perfect substitute for 3D grids, just as the old loom was for 2D ones.

The most exciting part of their discovery is how they connect this 3D loom to the tangled road maps (3-graphs). In the 2D world, the connection was straightforward: the loom's rules matched the road map's rules. But in 3D, things get tricky. To build a valid 3-graph, the roads must not just cross; they must follow a strict "associativity" rule, meaning that if you take three different colored paths and swap their order in different ways, you must end up at the exact same destination. The authors show that their 3D textile system naturally encodes this complex rule. They demonstrate that the conditions required to make a valid 3-graph are exactly the same as the conditions that make their 3D textile system work, which they describe using simple "pullback diagrams" (a way of saying the pieces fit together like a perfect jigsaw puzzle).

Beyond just weaving patterns, the authors also build a new kind of algebra (a system for doing math with these patterns) called the textile algebra. They show that when you use their 3D textile system, the resulting algebra behaves exactly like the algebra associated with the 3-graph. Furthermore, they define a way to measure the "holes" or shapes within these 3D textiles (called homology) and prove that these measurements are identical to the measurements of the corresponding 3-graph. This confirms that their construction is not just a clever trick, but a mathematically consistent and accurate way to understand 3D patterns.

In short, this paper successfully extends the "textile framework" from two dimensions to three. It provides a new, unified language that allows mathematicians to translate between 3D pattern grids and 3D road maps, proving that the deep connection between weaving and graph theory holds true even in the third dimension. By doing so, they open the door for future research into even higher dimensions, offering a fresh perspective on how complex, multi-dimensional systems can be understood through simple, weaving-like rules.

Technical Summary: Higher-Dimensional Symbolic Dynamics: A Textile Framework for 3-Graphs

Problem Statement
The paper addresses the challenge of extending symbolic dynamics and combinatorial algebraic structures from one and two dimensions to higher dimensions. While one-dimensional shifts of finite type are well-modeled by directed graphs and their associated algebras (e.g., Leavitt path algebras), and two-dimensional shifts are effectively modeled by textile systems and 2-graphs, the transition to dimension three presents significant difficulties. Specifically, constructing a $k$ -graph from a $k$ -colored graph for $k \ge 3$ requires more than simple commutativity of bicolored paths; it necessitates a complex associativity condition on tricolored paths (the "Yang-Baxter" condition). The authors identify a gap in the literature: there is no established "textile framework" for 3-graphs that mirrors the successful correspondence between left-resolving textile systems and 2-graphs. Furthermore, the algebraic and homological invariants of these higher-dimensional structures require a unified framework.

Methodology
The authors employ a combination of symbolic dynamics, category theory, and operator algebra techniques.

Algebraic Construction: They define a "textile algebra" $A(T)$ associated with a standard two-dimensional textile system $T$ using generators and relations. This algebra is shown to generalize Leavitt path algebras and, in the case of left-resolving (LR) systems, coincide with Kumjian–Pask algebras of 2-graphs.
Groupoid Modeling: They construct a Deaconu–Renault groupoid associated with the first-quadrant shift space of an LR-textile system, proving that the Steinberg algebra of this groupoid recovers the textile algebra.
Dimensional Extension: The core methodology involves defining a "three-dimensional textile system" as a diagram of four directed graphs ( $G, F_1, F_2, E$ ) and six graph homomorphisms satisfying specific commutativity and injectivity conditions. This structure is interpreted categorically as a functor from a parallel arrow category to the category of 2D textile systems.
Correspondence Proofs: The authors utilize pullback diagrams to encode the factorization rules and associativity conditions required for 3-graphs. They establish a bi-directional correspondence: deriving a 3-graph from a 3D textile and vice versa.
Homological Analysis: They define chain complexes for both 3D textile systems and 3-graphs, utilizing boundary maps derived from the graph structures and factorization rules, to compare their homology groups.

Key Contributions and Results

Textile Algebra and Diagonal Graphs: For a two-dimensional textile system $T$ , the authors define the textile algebra $A(T)$ . They introduce the "diagonal graph" $\Delta_T$ and prove that for an LR-textile system, the two-dimensional first-quadrant shift space is uniquely determined by the one-dimensional edge shift of $\Delta_T$ . Furthermore, they establish an injective $\mathbb{Z}$ -graded homomorphism from the Leavitt path algebra of $\Delta_T$ into $A(T)$ , which preserves the diagonal subalgebras.
Groupoid Model: They demonstrate that the textile algebra of an LR-textile system is isomorphic to the Steinberg algebra of the associated Deaconu–Renault groupoid, providing a groupoid model for the algebra.
Three-Dimensional Textile Systems: The paper proposes a formal definition of a 3D textile system. It proves that any 3D shift of finite type can be represented as a 3D textile shift (up to higher-block presentation). Categorical interpretations are provided, showing 3D textiles as functors from a parallel arrow category to the category of 2D textiles.
Textile-3-Graph Correspondence:
- The authors show that any 3-graph naturally induces a 3D textile system where the morphisms satisfy unique path lifting properties and specific pullback square conditions.
- Conversely, they prove that a 3D textile system satisfying these pullback and lifting conditions (specifically, unique $s$ -path lifting for one morphism and unique $r$ -path lifting for others) yields a valid 3-graph. This result translates the complex associativity condition of 3-graphs (KG3) into simple pullback diagrams arising from the textile data.
- A constructive method is provided to generate a 3D textile (and associated 3-graph) from two 2D textile systems sharing a common base graph via a pullback isomorphism.
Homological Consistency: The authors define homology groups for 3D textile systems. They prove that the chain complex of a 3D textile system is isomorphic to the chain complex of the associated 3-graph. Consequently, the integral homology groups of the textile system coincide with those of the 3-graph. They also define graded homology for 2D textiles and show it is isomorphic to the homology of the skew-product of the associated 2-graph.

Significance
The paper claims to successfully extend the established relationship between textile systems and higher-rank graphs from dimension 2 to dimension 3. By encoding the delicate associativity conditions of 3-graphs into the combinatorial data of 3D textiles (specifically via pullback diagrams), the authors provide a new "textile-like" framework for studying 3-graphs. This framework allows for the translation of dynamical properties (shift spaces) and algebraic structures (textile algebras, groupoids) into the language of 3-graphs and vice versa. The homological results confirm that this construction is consistent with existing theories, establishing that the structural connections observed in dimension 2 persist in dimension 3. The work opens the possibility for further investigation into higher-dimensional textile systems and their algebraic and dynamical invariants.

More like this