Piecewise-Canonical Homeomorphisms of Edge Shifts

• Piecewise-canonical homeomorphisms are constructed by partitioning an edge shift into cylinder sets and applying canonical prefix replacement maps.
• They synthesize graph-theoretic cylinder calculus with sliding-block code methods using weak progressiveness and regressive block maps.
• This framework unifies symbolic dynamics, Cantor dynamics, and diagram groups while offering effective algorithms for conjugacy and structural analysis.

Searching arXiv for the cited work and closely related papers on piecewise-canonical homeomorphisms of edge shifts. Piecewise-canonical homeomorphisms of edge shifts are homeomorphisms obtained by partitioning an edge-shift space into finitely many cylinder sets and acting on each part by a canonical prefix-replacement map. In the formulation developed for finite directed graphs $\Gamma$, the underlying space $S(\Gamma\mid Y)$ consists of infinite paths starting from a finite ordered multiset $Y$ of initial vertices, topologized by cylinder sets $C_w$ determined by finite prefixes $w$; when two prefixes $p,q$ have the same terminal vertex, there is a canonical homeomorphism $\Phi_{p,q}:C_p\to C_q$ given by $\Phi_{p,q}(p\alpha)=q\alpha$ (Tarocchi, 4 Aug 2025). A piecewise-canonical homeomorphism is then a global homeomorphism assembled from finitely many such canonical cylinderwise identifications. In parallel, the sliding-block-code analysis of local homeomorphisms and $*$-commutation for one-sided shifts supplies a classification blueprint: local homeomorphism behavior is controlled by weakly progressive block maps, $*$-commutation with the shift by regressive block maps, and the conjunction yields $S(\Gamma\mid Y)$0-fold covering maps (Willis, 2010). The combination of these viewpoints places piecewise-canonical homeomorphisms at the intersection of symbolic dynamics, Cantor dynamics, diagram groups, and the algebra of topological full groups.

1. Edge shifts, cylinders, and canonical prefix exchange

Let $S(\Gamma\mid Y)$1 be a finite directed graph, and let $S(\Gamma\mid Y)$2 be a finite ordered multiset over $S(\Gamma\mid Y)$3. The edge-shift space considered in the recent literature is

$S(\Gamma\mid Y)$4

the set of infinite directed paths starting from the specified initial multiset (Tarocchi, 4 Aug 2025). Its finite-prefix language, including a trivial empty path at each $S(\Gamma\mid Y)$5, is denoted $S(\Gamma\mid Y)$6. For each $S(\Gamma\mid Y)$7, the associated cylinder

$S(\Gamma\mid Y)$8

is a basic clopen set, and these cylinders generate the topology, making $S(\Gamma\mid Y)$9 a Cantor space plus possibly isolated points (Tarocchi, 4 Aug 2025).

The fundamental local model is the canonical homeomorphism between cylinders of the same terminal color. If $Y$0 satisfy $Y$1, then

$Y$2

is a homeomorphism, often written in prefix-exchange notation as $Y$3 (Tarocchi, 4 Aug 2025). This is the basic “piece” from which piecewise-canonical maps are assembled.

A homeomorphism $Y$4 is piecewise-canonical if there exist finite cylinder partitions $Y$5 and $Y$6 of $Y$7 such that for each $Y$8 one has

$Y$9

equivalently $C_w$0 on each piece (Tarocchi, 4 Aug 2025). The group of all such homeomorphisms is denoted $C_w$1.

This definition places the emphasis on prefix replacement rather than arbitrary local coding. The resulting maps are globally homeomorphisms by construction, but their local symbolic structure is still naturally compared with sliding-block codes, especially when one asks for compatibility with the shift or for classification via covering behavior. This suggests an overview between the graph-theoretic cylinder calculus of piecewise-canonical maps and the block-map criteria developed for one-sided shifts (Willis, 2010).

2. Group structure, diagrams, and representative families

Under composition, piecewise-canonical homeomorphisms form a group $C_w$2 (Tarocchi, 4 Aug 2025). A broader groupoid $C_w$3 is obtained by allowing morphisms between spaces $C_w$4 and $C_w$5 for varying ordered multisets $C_w$6, with composition implemented by refining and de-refining cylinder partitions. In diagrammatic language, elements are encoded by forest-pair diagrams $C_w$7 in which $C_w$8 and $C_w$9 are finite complete rooted subforests of the infinite rooted forest of prefixes $w$0, and $w$1 is a leaf-color-preserving bijection between them (Tarocchi, 4 Aug 2025).

A basic structural fact is that every element factors, after reductions, as a split part, followed by a permutation part, followed by a merge part. Split diagrams subdivide cylinders into their children; permutation diagrams permute cylinders of equal color; merge diagrams invert splits (Tarocchi, 4 Aug 2025). Correspondingly, $w$2 is generated by the infinite set of all split diagrams together with all permutation diagrams (Tarocchi, 4 Aug 2025).

Several standard groups occur as special cases.

Choice of $w$3 and $w$4	Resulting group
One vertex with $w$5 loop-edges; $w$6 consists of $w$7 copies of the vertex	Higman–Thompson group $w$8
Disjoint union of $w$9 half-lines	Houghton group $p,q$0
Suitable graph with two loops plus an isolated loop	Thompson-like group $p,q$1

These identifications show that piecewise-canonical homeomorphisms of edge shifts form a unifying framework for several diagrammatic and Cantor-dynamical groups (Tarocchi, 4 Aug 2025). In the irreducible case, and with $p,q$2 containing one copy of each vertex, Matui’s results imply that the associated topological full group is of type $p,q$3 and that its commutator subgroup is simple and finitely generated (Tarocchi, 4 Aug 2025). The same source states more generally that for any $p,q$4, the commutator subgroup sits as a normal subgroup of index at most two and often is simple (Tarocchi, 4 Aug 2025).

The forest-pair formalism also provides normal forms. Every element of $p,q$5 has a unique reduced forest-pair diagram; any two representations differ by a sequence of expansions and reductions, either degenerate or regular (Tarocchi, 4 Aug 2025). When $p,q$6 is irreducible, this yields finite generation and indeed finite presentability (Tarocchi, 4 Aug 2025).

3. Sliding-block codes, local homeomorphisms, and the weakly progressive criterion

The symbolic-dynamical counterpart begins with finite alphabets $p,q$7, a block map of memory $p,q$8,

$p,q$9

and the induced sliding-block code $\Phi_{p,q}:C_p\to C_q$0 defined by

$\Phi_{p,q}:C_p\to C_q$1

(Willis, 2010). Such maps are continuous and commute with the one-sided shift $\Phi_{p,q}:C_p\to C_q$2 (Willis, 2010).

A continuous map $\Phi_{p,q}:C_p\to C_q$3 is a local homeomorphism if every point has a neighborhood on which $\Phi_{p,q}:C_p\to C_q$4 restricts to a homeomorphism onto an open image (Willis, 2010). For sliding-block codes, the classical sufficient condition is progressiveness: a block map $\Phi_{p,q}:C_p\to C_q$5 is progressive if for every fixed prefix $\Phi_{p,q}:C_p\to C_q$6, the map

$\Phi_{p,q}:C_p\to C_q$7

is a bijection of $\Phi_{p,q}:C_p\to C_q$8 (Willis, 2010). Exel–Renault’s theorem states that if $\Phi_{p,q}:C_p\to C_q$9 is progressive, then $\Phi_{p,q}(p\alpha)=q\alpha$0 is a local homeomorphism (Willis, 2010).

The key refinement in Willis’s work is that progressiveness is not necessary. The paper gives an explicit block map on $\Phi_{p,q}(p\alpha)=q\alpha$1: $\Phi_{p,q}(p\alpha)=q\alpha$2

$\Phi_{p,q}(p\alpha)=q\alpha$3

$\Phi_{p,q}(p\alpha)=q\alpha$4

$\Phi_{p,q}(p\alpha)=q\alpha$5

for which no progressive block map defines the same sliding-block code, yet the induced map is a local homeomorphism; on the clopen sets $\Phi_{p,q}(p\alpha)=q\alpha$6 and $\Phi_{p,q}(p\alpha)=q\alpha$7 it is a homeomorphism onto the full shift (Willis, 2010). This counterexample motivates the generalized notion of weak progressiveness.

A block map $\Phi_{p,q}(p\alpha)=q\alpha$8 is weakly progressive of order $\Phi_{p,q}(p\alpha)=q\alpha$9 if for every $*$0 and every target block $*$1 beginning with $*$2 for some $*$3, there exists a unique length-$*$4 extension $*$5 such that the length-$*$6 sliding-block output equals $*$7 (Willis, 2010). Proposition 3.10 asserts that if $*$8 is weakly progressive, then for each $*$9 the restriction

$*$0

is bijective (Willis, 2010). Theorem 3.11 then concludes that every sliding-block code arising from a weakly progressive block map is a local homeomorphism (Willis, 2010).

For piecewise-canonical edge-shift homeomorphisms, this criterion furnishes the local-homeomorphism side of the classification blueprint: whenever a cylinder restriction is modeled by a sliding-block code, weak progressiveness is the sufficient hypothesis ensuring that the piece is locally homeomorphic in the symbolic sense (Willis, 2010). This suggests that piecewise-canonical maps compatible with shift dynamics should be locally constrained by weakly progressive block maps on each cylinder piece.

4. $*$1-commutation, regressive block maps, and covering behavior

Willis also isolates the correct symbolic criterion for a stronger compatibility with the shift. Two endomorphisms $*$2 of a set $*$3 are said to $*$4-commute if

1. $*$5, and
2. whenever $*$6, there exists a unique $*$7 with $*$8 and $*$9

(Willis, 2010). For sliding-block codes, the relevant pair is $S(\Gamma\mid Y)$00 and $S(\Gamma\mid Y)$01.

A block map $S(\Gamma\mid Y)$02 is regressive if for each fixed suffix $S(\Gamma\mid Y)$03, the map

$S(\Gamma\mid Y)$04

is a bijection of $S(\Gamma\mid Y)$05 (Willis, 2010). Theorem 4.9 states that a sliding-block code $S(\Gamma\mid Y)$06 $S(\Gamma\mid Y)$07-commutes with the shift $S(\Gamma\mid Y)$08 if and only if $S(\Gamma\mid Y)$09 is regressive (Willis, 2010). The proof uses the bijectivity of the suffix maps to build the unique lift required in the definition of $S(\Gamma\mid Y)$10-commutation, and conversely shows that the lifting property forces injectivity, hence bijectivity, of each $S(\Gamma\mid Y)$11 on finite alphabets (Willis, 2010).

The combined local-homeomorphism and $S(\Gamma\mid Y)$12-commutation hypotheses have a covering-theoretic consequence. A continuous surjection $S(\Gamma\mid Y)$13 is a $S(\Gamma\mid Y)$14-fold covering if every $S(\Gamma\mid Y)$15 has a neighborhood $S(\Gamma\mid Y)$16 such that $S(\Gamma\mid Y)$17 is the disjoint union of $S(\Gamma\mid Y)$18 open sets, each mapped homeomorphically onto $S(\Gamma\mid Y)$19 (Willis, 2010). Proposition 5.13 states that if $S(\Gamma\mid Y)$20 is both a local homeomorphism and $S(\Gamma\mid Y)$21-commutes with $S(\Gamma\mid Y)$22, then $S(\Gamma\mid Y)$23 is a $S(\Gamma\mid Y)$24-fold covering map for some $S(\Gamma\mid Y)$25 (Willis, 2010). The argument combines local homeomorphism with the constancy and finiteness of fiber cardinality implied by $S(\Gamma\mid Y)$26-commutation (Willis, 2010).

Theorem 5.14 packages the conclusion into an equivalence: for $S(\Gamma\mid Y)$27, the following are equivalent:

• $S(\Gamma\mid Y)$28 is a local homeomorphism and $S(\Gamma\mid Y)$29-commutes with $S(\Gamma\mid Y)$30;
• $S(\Gamma\mid Y)$31 is regressive and $S(\Gamma\mid Y)$32 is a $S(\Gamma\mid Y)$33-fold covering map, with $S(\Gamma\mid Y)$34

(Willis, 2010).

This characterization is directly relevant to piecewise-canonical edge-shift homeomorphisms when one imposes global shift commutation. In that setting, each cylinderwise block-code piece should satisfy the regressive condition to obtain $S(\Gamma\mid Y)$35-commutation and the weakly progressive condition to obtain local homeomorphism; the resulting pieces then exhibit uniform finite-sheeted covering behavior (Willis, 2010). A plausible implication is that the symbolic rigidity expressed by regressiveness plays, on each piece, the same role as the canonical tail-preserving condition in the graph-theoretic definition.

5. Classification blueprint for piecewise-canonical shift-commuting homeomorphisms

The provided classification blueprint adapts the one-sided-shift results to edge shifts. An edge shift $S(\Gamma\mid Y)$36 is specified by a finite directed graph $S(\Gamma\mid Y)$37, and a piecewise-canonical homeomorphism $S(\Gamma\mid Y)$38 of $S(\Gamma\mid Y)$39 is, by definition, a global homeomorphism that on finitely many cylinder sets acts by sliding-block codes, equivalently by finite-memory maps on edges (Willis, 2010). According to this blueprint, each cylinder restriction $S(\Gamma\mid Y)$40 arising from a block map $S(\Gamma\mid Y)$41 must satisfy the following conditions (Willis, 2010):

1. to be locally a homeomorphism, $S(\Gamma\mid Y)$42 must be weakly progressive;
2. to $S(\Gamma\mid Y)$43-commute with $S(\Gamma\mid Y)$44, $S(\Gamma\mid Y)$45 must be regressive;
3. therefore each piece is a $S(\Gamma\mid Y)$46-fold covering for some $S(\Gamma\mid Y)$47;
4. the compatibility conditions on overlaps of the partition cylinders force all $S(\Gamma\mid Y)$48 to be the same $S(\Gamma\mid Y)$49, making $S(\Gamma\mid Y)$50 a global $S(\Gamma\mid Y)$51-fold covering of $S(\Gamma\mid Y)$52 by itself.

In the notation given there,

$S(\Gamma\mid Y)$53

with each $S(\Gamma\mid Y)$54 regressive and weakly progressive (Willis, 2010). The covering index $S(\Gamma\mid Y)$55 is constant, and on each piece the map is injective onto a full shift-invariant open set (Willis, 2010). Reassembling the pieces yields a global homeomorphism that is a regular $S(\Gamma\mid Y)$56-fold covering of $S(\Gamma\mid Y)$57 by itself, and conversely every $S(\Gamma\mid Y)$58-fold covering arising from a regressive block map is piecewise-canonical in this sense (Willis, 2010). The stated conclusion is a complete classification: piecewise-canonical $S(\Gamma\mid Y)$59-commuting homeomorphisms of an edge shift $S(\Gamma\mid Y)$60 are exactly the regressive/weakly progressive sliding-block codes that assemble to a global $S(\Gamma\mid Y)$61-fold covering (Willis, 2010).

Because this blueprint is presented as a synthesized “final classification” in the supplied account, it should be read with some care. The graph-theoretic definition of piecewise-canonical homeomorphism in Tarocchi’s work is stated directly in terms of canonical prefix exchange, whereas the classification blueprint phrases the pieces as sliding-block codes on cylinders [(Tarocchi, 4 Aug 2025); (Willis, 2010)]. This suggests an identification between canonical cylinder maps and finite-memory edge substitutions on suitable partitions. A plausible implication is that the blueprint is best understood as a symbolic-dynamical normal form for those piecewise-canonical maps that also commute with the shift.

6. Conjugacy, strand diagrams, and the loops semigroup

Tarocchi’s principal theorem is algorithmic: for every finite graph $S(\Gamma\mid Y)$62 and every initial multiset $S(\Gamma\mid Y)$63, the group $S(\Gamma\mid Y)$64 has solvable conjugacy problem (Tarocchi, 4 Aug 2025). The proof adapts strand diagrams, introduced by Belk and Matucci for Thompson’s groups $S(\Gamma\mid Y)$65, $S(\Gamma\mid Y)$66, and $S(\Gamma\mid Y)$67, to the setting of edge shifts and supplements them with a commutative semigroup of loops (Tarocchi, 4 Aug 2025).

A $S(\Gamma\mid Y)$68-strand diagram is a finite directed acyclic graph with vertices colored by $S(\Gamma\mid Y)$69 and local combinatorics matching the branching structure of the path forest $S(\Gamma\mid Y)$70 (Tarocchi, 4 Aug 2025). Sources are roots of split carets, sinks are leaves of merge carets, splits and merges respect color-ordering constraints, and degenerate vertices correspond to isolated unary loops in $S(\Gamma\mid Y)$71 (Tarocchi, 4 Aug 2025). Every piecewise-canonical map between $S(\Gamma\mid Y)$72 and $S(\Gamma\mid Y)$73 is represented uniquely, up to local reductions of types $S(\Gamma\mid Y)$74, by such a diagram with source colors given by $S(\Gamma\mid Y)$75 and sink colors by $S(\Gamma\mid Y)$76 (Tarocchi, 4 Aug 2025).

To test conjugacy of two elements represented by reduced strand diagrams $S(\Gamma\mid Y)$77 and $S(\Gamma\mid Y)$78, one closes the diagrams by identifying sources with sinks in order, obtaining closed strand diagrams $S(\Gamma\mid Y)$79 and $S(\Gamma\mid Y)$80 (Tarocchi, 4 Aug 2025). One then works with several classes of transformations:

• similarities, namely base-line shifts through splits and merges, and base-line permutations;
• reductions and inverse reductions of types $S(\Gamma\mid Y)$81;
• a new type $S(\Gamma\mid Y)$82 reduction (Tarocchi, 4 Aug 2025).

The type $S(\Gamma\mid Y)$83 reduction is defined as follows. If a closed diagram contains a consecutive block of $S(\Gamma\mid Y)$84 base-points

$S(\Gamma\mid Y)$85

which split into $S(\Gamma\mid Y)$86 loops of winding number $S(\Gamma\mid Y)$87 in colors $S(\Gamma\mid Y)$88, where $S(\Gamma\mid Y)$89 are exactly the terminal colors $S(\Gamma\mid Y)$90 of the $S(\Gamma\mid Y)$91 edges $S(\Gamma\mid Y)$92 emanating from some vertex $S(\Gamma\mid Y)$93, then one may collapse the entire family of $S(\Gamma\mid Y)$94 loops to a single $S(\Gamma\mid Y)$95-loop of winding number $S(\Gamma\mid Y)$96 (Tarocchi, 4 Aug 2025). Every similarity or reduction of types $S(\Gamma\mid Y)$97–$S(\Gamma\mid Y)$98 is realized by conjugating the underlying open diagram by products of split and merge diagrams, so these operations preserve conjugacy class (Tarocchi, 4 Aug 2025).

Proposition 4.1 states that two diagrams $S(\Gamma\mid Y)$99 with identical source and sink colors represent conjugate elements if and only if $Y$00 and $Y$01 are related by a finite sequence of similarities, reductions or inverse reductions of types $Y$02, and type $Y$03 reductions or inverses (Tarocchi, 4 Aug 2025). This yields Algorithm 5.1, a three-step conjugacy test:

1. apply all possible type $Y$04 reductions, unlocked by similarities, to obtain unique semi-reduced forms via Newman’s Lemma;
2. compare the split-merge parts up to similarity, equivalently by a finite graph-cohomology test on cocycles;
3. extract the loop parts and compare them in a commutative semigroup $Y$05 (Tarocchi, 4 Aug 2025).

The semigroup $Y$06 is generated by loop symbols $Y$07 for colors $Y$08 and winding numbers $Y$09, subject to relations

$Y$10

whenever $Y$11 are the edges emanating from $Y$12 and $Y$13 (Tarocchi, 4 Aug 2025). Type $Y$14 reduction is exactly replacement of the left-hand multiset sum by the single generator, or conversely (Tarocchi, 4 Aug 2025). For each $Y$15, the subsemigroup $Y$16 generated by loops of winding number at most $Y$17 is finitely presented, the chain $Y$18 is increasing, and $Y$19 (Tarocchi, 4 Aug 2025). Because finitely presented commutative semigroups have decidable word problem, the loop-comparison step is effective (Tarocchi, 4 Aug 2025).

This algorithmic structure is central to the contemporary significance of piecewise-canonical homeomorphisms. It shows that the class is not only structurally rich but also diagrammatically tractable.

7. Relation to topological full groups and current directions

The most immediate ambient context is that of topological full groups of irreducible edge shifts. Tarocchi states that the techniques used to solve the conjugacy problem in these full groups work in the larger class of piecewise-canonical homeomorphisms of edge shifts, described there as essentially the prefix-exchange transformations (Tarocchi, 4 Aug 2025). Thus piecewise-canonical homeomorphisms serve both as a natural generalization of edge-shift full groups and as a common framework encompassing groups such as the Houghton groups and $Y$20 (Tarocchi, 4 Aug 2025).

From the structural side, the irreducible case retains familiar finiteness and simplicity phenomena: when $Y$21 is irreducible and $Y$22, the commutator subgroup is simple and finitely generated, and the full group is of type $Y$23 (Tarocchi, 4 Aug 2025). From the algorithmic side, the conjugacy problem is solvable for all finite graphs $Y$24 and all initial multisets $Y$25, not just in the irreducible case (Tarocchi, 4 Aug 2025). All intermediate constructions—forest-pair diagrams, strand diagrams, closed diagrams, and the loops semigroup—are described as effective (Tarocchi, 4 Aug 2025).

The supplied open directions are also specific. They include analyzing the computational complexity of the conjugacy algorithm, extending the strand-diagram plus loops-semigroup method to other diagram groups or topological full groups of more general étale groupoids, and investigating whether commutator-subgroup simplicity extends beyond the irreducible case and whether such simplicity can be witnessed diagrammatically (Tarocchi, 4 Aug 2025).

A recurrent misconception is to identify piecewise-canonical homeomorphisms with arbitrary cylinderwise homeomorphisms. The data instead define them by a very rigid local form: each piece is a canonical replacement of one prefix by another with the same terminal color (Tarocchi, 4 Aug 2025). Another potential misconception is to equate local homeomorphism for sliding-block codes with the older progressive condition. Willis’s counterexample shows that this is false; weak progressiveness is strictly more general (Willis, 2010). Taken together, these points indicate that the theory is shaped by two different but compatible notions of locality: canonical prefix replacement on graph cylinders, and finite-memory symbolic coding with precise bijectivity constraints on prefixes or suffixes. The present literature uses this compatibility to connect dynamical classification, covering theory, and effective conjugacy in a single framework [(Willis, 2010); (Tarocchi, 4 Aug 2025)].