Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.21708

Relating insplittings of 2-graphs and of textile systems

Samantha Brooker·Priyanga Ganesan·Elizabeth Gillaspy·Ying-Fen Lin·David Pask·Julia Plavnik
View original source ↗Read source document ↗Export metadata ↓

Abstract

The graphical operation of insplitting is key to understanding conjugacy of shifts of finite type (SFTs) in both one and two dimensions. In this paper, we consider two approaches to studying 2-dimensional SFTs: textile systems and rank-2 graphs. Nasu's textile systems describe all two-sided 2D SFTs up to conjugacy, whereas the 2-graphs (higher-rank graphs of rank 2) introduced by Kumjian and Pask yield associated C*-algebras. Both models have a naturally-associated notion of insplitting. We show that these notions do not coincide, raising the question of whether insplitting a 2-graph induces a conjugacy of the associated one-sided 2-dimensional SFTs. Our first main result shows how to reconstruct 2-graph insplitting using textile-system insplits and inversions, and consequently proves that 2-graph insplitting induces a conjugacy of dynamical systems. We also present several other facets of the relationship between 2-graph insplitting and textile-system insplitting. Incorporating an insplit of the bottom graph of the textile system turns out to be key to this relationship. By articulating the connection between operator-algebraic and dynamical notions of insplitting in two dimensions, this article lays the groundwork for a C*-algebraic framework for classifying one-sided conjugacy in higher-dimensional SFTs.

Explore related subjects

math.OAmath.CTmath.DSmath.FA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samantha Brooker, Priyanga Ganesan, Elizabeth Gillaspy, Ying-Fen Lin, David Pask, Julia Plavnik. 2025-06-26. Relating insplittings of 2-graphs and of textile systems. https://arxiv.org/abs/2506.21708

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Set-theoretic absoluteness for analysts and separable \cstar-algebras without Choice

Basic theory of separable C*-algebras can be developed without the Axiom of Choice, and it does not depend on the Continuum Hypothesis, Martin's Axiom, and other standard set-theoretic assumptions. This can be proved in two ways. First, by showing that the standard proofs do not require Choice. Second, by utilizing set-theoretic absoluteness theorems. We provide an introduction to projective complexity and absoluteness for analysts. We also give some limiting examples consistent with ZF, such as a commutative \cstar-algebra concretely represented on a Hilbert space but not isomorphic to $C(X)$ for any compact Hausdorff space $X$ and whose state space is not compact and has no extreme points.

math.OA↗
arXiv2026

Schur Multipliers with Unequal Operator and Completely Bounded Norms on $S_p$, $1<p\ne 2<\infty $

For every $1<p\neq2<\infty$, we exhibit an explicit Schur multiplier on $S_p$ whose operator norm is strictly smaller than its completely bounded norm. More precisely, for each such $p$, we construct a finitely supported Schur symbol $m_p$ such that \[ \|M_{m_p}\|_{p\to p} < \|M_{m_p}\|_{\mathrm{cb},p}. \] This answers the question raised by Lafforgue and de la Salle in 2011 after their Conjecture~1.8 and gives an affirmative answer to Statement~2 in Section~5 of Caspers and Wildschut (2019). In particular, it disproves Statement~3 of Caspers and Wildschut (2019) throughout the same range of exponents.

math.OA↗
arXiv2026

Stationary states on a $C^*$-algebra for an inner action

We study stationary states for actions of countable discrete groups on unital separable $C^*$-algebras. We prove that the stationary state space associated with an inner action of a subgroup of the unitary group that generates the algebra is a Choquet simplex. We also give a locality criterion covering Bernoulli shifts. The simplex structure yields a canonical decomposition of stationary states into tracial and purely nontracial parts. For inner actions, we characterize extreme stationary states by factoriality of their GNS von Neumann algebras. We further show that a stationary state is tracial if and only if its GNS von Neumann algebra is finite, and that it is purely nontracial if and only if this algebra is of type~$\mathrm{III}$. As applications, for $2\leq d\leq\infty$ the stationary state simplex of $C^*(\mathbb{F}_d)$ has a Poulsen face, while for a nontrivial property~$(T)$ group the stationary state simplex of $C^*(Γ)$ is not Poulsen. Finally, we give a sufficient spectral-gap condition for $S_μ(A)$ to be a Bauer simplex and construct a family $(A_d,Γ_d,μ_d)$ satisfying this condition.

math.OA↗