Graph Wreath Products

• Graph wreath products are constructions that assemble graph-indexed copies of groups or graphs with a semidirect product action, generalizing classical wreath products.
• They integrate combinatorial, geometric, and operator-algebraic methods, enabling explicit studies of finiteness conditions, growth series, and automorphism groups.
• Applications span group theory, graph theory, and quantum algebra, allowing researchers to compute metrics, spectral properties, and explore quantum symmetry frameworks.

Searching arXiv for recent and foundational papers on graph wreath products and closely related constructions. to=arxiv_search.search anasiyana 玩北京赛车 เงินฟรี 彩票主管 to=arxiv_search.search գործում 彩票天天 天天中彩票是不是({ "^^^^^^^^4query4 "^^^^^^^^4\4 wreath product^^^^^^^^4\4 OR ^^^^^^^^4\4 product^^^^^^^^4\4 OR ^^^^^^^^4\4 product of graphs^^^^^^^^4\4 "max_results": ^^^^4\4query4^^^^, "sort_by": "relevance" }) to=arxiv_search.search 天天中彩票中奖 彩网大发快三 山大发 to=arxiv_search.search գործում ,超碰({ "^^^^^^^^4query4 "^^^^^^^^4\4 growth series of some wreath products^^^^^^^^4\4 OR (&&&^^^^4query4^^^^&&&) OR ^^^^^^^^4\4 products and finiteness conditions^^^^^^^^4\4 OR (&&&^^^^4\4^^^^&&&)", "max_results": ^^^^4\4query4^^^^, "sort_by": "relevance" }) Graph wreath products are constructions in which a graph, a group action on a graph, or a family of graph-indexed copies of another object is assembled into a larger combinatorial or algebraic object. In the literature considered here, the term is used in several related but non-identical senses. In group theory, Kropholler and Martino define the graph-wreath product by

PRESERVED_PLACEHOLDER_^^^^4query4^^^^

where PRESERVED_PLACEHOLDER_^^^^4\4^^^^ is the graph product of copies of PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^ indexed by the vertices of an PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^-graph $\Gamma$ (&&&^^^^4\4^^^^&&&). In graph theory, the wreath product of graphs $G$ and $H$ has vertex set $V_H^{V_G}\times V_G$ and admits “switch” and “walk” edges in the lamplighter sense (&&&^^^^4 OR \4^^^^&&&). In directed-graph combinatorics, $G\wr H$ is also used for the lexicographic product on $V(G)\times V(H)$ (Lacaze-Masmonteil, 2024). Quantum-group and operator-algebraic variants extend the same organizing idea to free wreath products and graphs of algebras (Bruyn et al., 18 Apr 2025, Fima et al., 2023).

^^^^4\4^^^^. Foundational definitions and scope

The graph-theoretic group construction starts from a simple graph PRESERVED_PLACEHOLDER_^^^^4\4query4^^^^ with vertex set PRESERVED_PLACEHOLDER_^^^^4\4\4^^^^ and an action PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^ by graph automorphisms. The graph product PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^ is obtained from the free product PRESERVED_PLACEHOLDER_^^^^4\44^^^^, with PRESERVED_PLACEHOLDER_^^^^4\4^^^^5, by imposing commuting relations between PRESERVED_PLACEHOLDER_^^^^4\4^^^^6 and PRESERVED_PLACEHOLDER_^^^^4\4^^^^7 whenever PRESERVED_PLACEHOLDER_^^^^4\4^^^^8 and PRESERVED_PLACEHOLDER_^^^^4\4^^^^9 are joined by an edge in PRESERVED_PLACEHOLDER_^^^^4 OR \4query4^^^^. The graph-wreath product is then the semidirect product PRESERVED_PLACEHOLDER_^^^^4 OR \4\4^^^^ induced by the PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^-action on vertices (&&&^^^^4\4^^^^&&&).

This construction interpolates between several classical cases. If PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^ is discrete, then PRESERVED_PLACEHOLDER_^^^^4 OR \44^^^^. If PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^5 is complete, then PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^6, and PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^7 becomes the restricted permutational wreath product PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^8 for the PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^9-set PRESERVED_PLACEHOLDER_^^^^4 OR \4query4^^^^. When PRESERVED_PLACEHOLDER_^^^^4 OR \4\4^^^^, PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^ is the right-angled Artin group on PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^; when PRESERVED_PLACEHOLDER_^^^^4 OR \44^^^^, it is the right-angled Coxeter group. Accordingly, graph-wreath products include classical permutational wreath products and semidirect products of right-angled Artin groups by groups of graph automorphisms (&&&^^^^4\4^^^^&&&).

A complementary viewpoint arises from classical wreath products PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^5 themselves. In the tree-based study of conjugacy growth, elements are interpreted as finitely supported vertex-labellings of the Cayley graph PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^6 by elements of PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^7, together with a distinguished cursor position in PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^8. Generators either move the cursor along an edge of the Cayley graph or modify the label at the current vertex. In that sense, ordinary wreath products become graph wreath products over Cayley graphs (&&&^^^^4query4^^^^&&&).

^^^^4 OR \4^^^^. Geometric models from Cayley graphs

For the restricted wreath product PRESERVED_PLACEHOLDER_^^^^4 OR \4^^^^9, an element $\Gamma$^^^^4query4^^^^ consists of a finitely supported map $\Gamma$^^^^4\4^^^^ and a cursor position $\Gamma$^^^^4 OR \4^^^^. The natural generating set extends the generating sets of $\Gamma$^^^^4 OR \4^^^^ and $\Gamma$4, and the corresponding word metric has a graph-theoretic description: the length of $\Gamma$5 is the length of a minimal walk in $\Gamma$6 starting at the identity, visiting every vertex where $\Gamma$7 is nontrivial, and ending at $\Gamma$8, plus the sum of the word lengths of the labels $\Gamma$9 (&&&^^^^4query4^^^^&&&).

When $G$^^^^4query4^^^^ is a tree, this walk combinatorics becomes especially rigid. The paper “Conjugacy growth series of some wreath products” studies groups

$G$^^^^4\4^^^^

with tree Cayley graph of degree $G$^^^^4 OR \4^^^^, and uses this geometry to compute conjugacy growth in terms of standard and conjugacy growth data for $G$^^^^4 OR \4^^^^. The analysis splits conjugacy classes into type $G$4 (cursor of infinite order) and type $G$5 (cursor of finite order), and expresses the type-$G$6 contribution through cyclically reduced words in the tree and Parry’s subtree generating function $G$7 (&&&^^^^4query4^^^^&&&).

The same graph viewpoint supports other geometric analyses of wreath products. In the Schreier-graph study of property FW, the wreath product $G$8 is examined through an imprimitive action on $G$9, where $H$^^^^4query4^^^^ is an $H$^^^^4\4^^^^-orbit in $H$^^^^4 OR \4^^^^. The corresponding Schreier graph decomposes into leaves $H$^^^^4 OR \4^^^^, each isomorphic to the orbital graph of $H$4, while the distinguished vertices $H$5 form a Cayley graph of $H$6. This “graph-of-graphs” structure yields the criterion that a finitely generated wreath product $H$7 has property FW if and only if $H$8 and $H$9 have property FW and $V_H^{V_G}\times V_G$^^^^4query4^^^^ is finite (&&&^^^^4\4 OR \4^^^^&&&).

^^^^4 OR \4^^^^. Graph-level wreath products, matrices, and distances

A distinct graph-theoretic construction takes two finite graphs $V_H^{V_G}\times V_G$^^^^4\4^^^^ and $V_H^{V_G}\times V_G$^^^^4 OR \4^^^^ and defines their wreath product $V_H^{V_G}\times V_G$^^^^4 OR \4^^^^ to have vertex set

$V_H^{V_G}\times V_G$4

Edges come in two types. “Switch” edges change only the lamp state at the current base vertex $V_H^{V_G}\times V_G$5, according to adjacency in $V_H^{V_G}\times V_G$6; “walk” edges move the lamplighter in $V_H^{V_G}\times V_G$7 while leaving the lamp configuration fixed. If $V_H^{V_G}\times V_G$8 is $V_H^{V_G}\times V_G$9-regular on $G\wr H$^^^^4query4^^^^ vertices and $G\wr H$^^^^4\4^^^^ is $G\wr H$^^^^4 OR \4^^^^-regular on $G\wr H$^^^^4 OR \4^^^^ vertices, then $G\wr H$4 has $G\wr H$5 vertices and is $G\wr H$6-regular (&&&^^^^4\4 OR \4^^^^&&&).

This graph wreath product admits an exact matrix model. If $G\wr H$7 and $G\wr H$8 are the normalized adjacency matrices of $G\wr H$9 and $V(G)\times V(H)$^^^^4query4^^^^, then

$V(G)\times V(H)$^^^^4\4^^^^

is the normalized adjacency matrix of $V(G)\times V(H)$^^^^4 OR \4^^^^, where the matrix wreath product is defined באמצעות Kronecker products and diagonal projectors $V(G)\times V(H)$^^^^4 OR \4^^^^. When the second factor is circulant, the spectrum of $V(G)\times V(H)$4 reduces to the union of spectra of $V(G)\times V(H)$5 matrices of order $V(G)\times V(H)$6, yielding explicit spectra for lamplighter walks such as the “Walk or switch” model on $V(G)\times V(H)$7 with two lamp colors (&&&^^^^4\4 OR \4^^^^&&&).

The metric structure of $V(G)\times V(H)$8 is equally explicit. For $V(G)\times V(H)$9, PRESERVED_PLACEHOLDER_^^^^4\4query4query4^^^^, PRESERVED_PLACEHOLDER_^^^^4\4query4\4^^^^, and vertices

PRESERVED_PLACEHOLDER_^^^^4\4query4 OR \4^^^^

the distance formula is

PRESERVED_PLACEHOLDER_^^^^4\4query4 OR \4^^^^

where PRESERVED_PLACEHOLDER_^^^^4\4query44^^^^ and PRESERVED_PLACEHOLDER_^^^^4\4query4^^^^5 is the minimum length of a path in PRESERVED_PLACEHOLDER_^^^^4\4query4^^^^6 from PRESERVED_PLACEHOLDER_^^^^4\4query4^^^^7 to PRESERVED_PLACEHOLDER_^^^^4\4query4^^^^8 visiting every vertex in PRESERVED_PLACEHOLDER_^^^^4\4query4^^^^9. From this one gets

PRESERVED_PLACEHOLDER_^^^^4\4\4query4^^^^

together with formulas for the antipodal graph, Wiener index, Szeged index, and Zagreb indices of PRESERVED_PLACEHOLDER_^^^^4\4\4\4^^^^ (&&&^^^^4 OR \4^^^^&&&).

A third graph-level convention uses “wreath product” for the lexicographic product of digraphs. Here PRESERVED_PLACEHOLDER_^^^^4\4\4 OR \4^^^^ has vertex set PRESERVED_PLACEHOLDER_^^^^4\4\4 OR \4^^^^, and an arc from PRESERVED_PLACEHOLDER_^^^^4\4\44^^^^ to PRESERVED_PLACEHOLDER_^^^^4\4\4^^^^5 exists whenever PRESERVED_PLACEHOLDER_^^^^4\4\4^^^^6, or PRESERVED_PLACEHOLDER_^^^^4\4\4^^^^7 and PRESERVED_PLACEHOLDER_^^^^4\4\4^^^^8. In that setting, recent work proves that if PRESERVED_PLACEHOLDER_^^^^4\4\4^^^^9 and PRESERVED_PLACEHOLDER_^^^^4\4 OR \4query4^^^^ are Hamiltonian decomposable directed graphs, then most open cases of the conjecture asserting Hamiltonian decomposability of PRESERVED_PLACEHOLDER_^^^^4\4 OR \4\4^^^^ are affirmative; the unresolved exceptions are concentrated in the case where PRESERVED_PLACEHOLDER_^^^^4\4 OR \4 OR \4^^^^ is a directed cycle and PRESERVED_PLACEHOLDER_^^^^4\4 OR \4 OR \4^^^^ has an odd number of Hamiltonian factors in a decomposition (Lacaze-Masmonteil, 2024).

4. Finiteness conditions and residual finiteness

For PRESERVED_PLACEHOLDER_^^^^4\4 OR \44^^^^, the basic finiteness properties are controlled by the action of PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^5 on the graph PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^6 and on its flag complex PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^7. If PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^8 is non-trivial, then PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^9 is finitely generated if and only if PRESERVED_PLACEHOLDER_^^^^4\4 OR \4query4^^^^ and PRESERVED_PLACEHOLDER_^^^^4\4 OR \4\4^^^^ are finitely generated and PRESERVED_PLACEHOLDER_^^^^4\4 OR \4 OR \4^^^^ has finitely many orbits of vertices. Likewise, PRESERVED_PLACEHOLDER_^^^^4\4 OR \4 OR \4^^^^ is finitely presented if and only if PRESERVED_PLACEHOLDER_^^^^4\4 OR \44^^^^ and PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^5 are finitely presented, PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^6 has finitely many orbits of vertices and edges, and each vertex stabilizer is finitely generated (&&&^^^^4\4^^^^&&&).

Higher finiteness conditions are formulated in terms of the clique modules PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^7, where PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^8 denotes the set of PRESERVED_PLACEHOLDER_^^^^4\4 OR \4^^^^9-simplices of the flag complex. The main sufficient criterion states that PRESERVED_PLACEHOLDER_^^^^4\44query4^^^^ is of type PRESERVED_PLACEHOLDER_^^^^4\44\4^^^^ if PRESERVED_PLACEHOLDER_^^^^4\44 OR \4^^^^ and PRESERVED_PLACEHOLDER_^^^^4\44 OR \4^^^^ are of type PRESERVED_PLACEHOLDER_^^^^4\444^^^^ and PRESERVED_PLACEHOLDER_^^^^4\44^^^^5 is of type PRESERVED_PLACEHOLDER_^^^^4\44^^^^6 over PRESERVED_PLACEHOLDER_^^^^4\44^^^^7 for PRESERVED_PLACEHOLDER_^^^^4\44^^^^8. When PRESERVED_PLACEHOLDER_^^^^4\44^^^^9 has infinite abelianization, these conditions become necessary and sufficient. When PRESERVED_PLACEHOLDER_^^^^4\4max_results4query4^^^^ is polycyclic-by-finite and PRESERVED_PLACEHOLDER_^^^^4\4max_results4\4^^^^ is non-trivial, the criterion simplifies: PRESERVED_PLACEHOLDER_^^^^4\4max_results4 OR \4^^^^ is of type PRESERVED_PLACEHOLDER_^^^^4\4max_results4 OR \4^^^^ if and only if PRESERVED_PLACEHOLDER_^^^^4\4^^^^54 is of type PRESERVED_PLACEHOLDER_^^^^4\4^^^^55 and PRESERVED_PLACEHOLDER_^^^^4\4^^^^56 acts cocompactly on the PRESERVED_PLACEHOLDER_^^^^4\4^^^^57-skeleton of PRESERVED_PLACEHOLDER_^^^^4\4^^^^58 (&&&^^^^4\4^^^^&&&).

Residual finiteness exhibits a similarly graph-sensitive behavior. For a graph PRESERVED_PLACEHOLDER_^^^^4\4^^^^59 with an action PRESERVED_PLACEHOLDER_^^^^4\4sort_by4query4^^^^ and graph product base PRESERVED_PLACEHOLDER_^^^^4\4sort_by4\4^^^^, the graph wreath product PRESERVED_PLACEHOLDER_^^^^4\4sort_by4 OR \4^^^^ is residually finite if and only if PRESERVED_PLACEHOLDER_^^^^4\4sort_by4 OR \4^^^^ and PRESERVED_PLACEHOLDER_^^^^4\4^^^^64 are residually finite and two separation conditions hold: one separates vertices from neighbors in finite-index PRESERVED_PLACEHOLDER_^^^^4\4^^^^65-orbits, and the other separates non-neighbors from the union PRESERVED_PLACEHOLDER_^^^^4\4^^^^66. In the complete-graph case this recovers Cornulier’s criterion for permutational wreath products; in the empty-graph case it recovers residual finiteness of free products of residually finite groups (&&&^^^^4\4^^^^9&&&).

5. Growth, Schreier geometry, and automata

The tree-based conjugacy-growth theory of PRESERVED_PLACEHOLDER_^^^^4\4^^^^67 yields explicit generating series. For type-PRESERVED_PLACEHOLDER_^^^^4\4^^^^68 conjugacy classes in the case where PRESERVED_PLACEHOLDER_^^^^4\4^^^^69 is a regular tree of degree PRESERVED_PLACEHOLDER_^^^^4\4relevance4query4^^^^, the contribution is

PRESERVED_PLACEHOLDER_^^^^4\4relevance4\4^^^^

where PRESERVED_PLACEHOLDER_^^^^4\4relevance4 OR \4^^^^ is built from Parry’s subtree series PRESERVED_PLACEHOLDER_^^^^4\4relevance4 OR \4^^^^ and the growth series of PRESERVED_PLACEHOLDER_^^^^4\4^^^^74. The paper proves that, for any such PRESERVED_PLACEHOLDER_^^^^4\4^^^^75, the radius of convergence of the conjugacy growth series equals the radius of convergence of the standard growth series. In the lamplighter case PRESERVED_PLACEHOLDER_^^^^4\4^^^^76, the resulting conjugacy growth series is transcendental over PRESERVED_PLACEHOLDER_^^^^4\4^^^^77 (&&&^^^^4query4^^^^&&&).

Schreier-graph methods provide another large-scale invariant. For finitely generated groups, property FW is equivalent to all Schreier graphs having at most one end. For a finitely generated wreath product PRESERVED_PLACEHOLDER_^^^^4\4^^^^78, this holds exactly when PRESERVED_PLACEHOLDER_^^^^4\4^^^^79 and PRESERVED_PLACEHOLDER_^^^^4\4query4query4^^^^ have property FW and the PRESERVED_PLACEHOLDER_^^^^4\4query4\4^^^^-set PRESERVED_PLACEHOLDER_^^^^4\4query4 OR \4^^^^ is finite. The proof is elementary and explicit: the relevant Schreier graphs decompose into leaves isomorphic to orbital graphs of PRESERVED_PLACEHOLDER_^^^^4\4query4 OR \4^^^^, glued along a spine that is a Schreier graph of PRESERVED_PLACEHOLDER_^^^^4\4^^^^84 (&&&^^^^4\4 OR \4^^^^&&&).

Automata-theoretic representations mirror the geometry of the base graph. Wreath products PRESERVED_PLACEHOLDER_^^^^4\4^^^^85 admit Cayley automatic representations by finite automata; PRESERVED_PLACEHOLDER_^^^^4\4^^^^86 admits context-free Cayley automatic representations via pushdown automata; and PRESERVED_PLACEHOLDER_^^^^4\4^^^^87 admits indexed Cayley automatic representations via nested stack automata. For PRESERVED_PLACEHOLDER_^^^^4\4^^^^88, if PRESERVED_PLACEHOLDER_^^^^4\4^^^^89 is the representative of PRESERVED_PLACEHOLDER_^^^^4\4\4query4^^^^, then

PRESERVED_PLACEHOLDER_^^^^4\4\4\4^^^^

For PRESERVED_PLACEHOLDER_^^^^4\4\4 OR \4^^^^, the corresponding bounds are

PRESERVED_PLACEHOLDER_^^^^4\4\4 OR \4^^^^

These constructions encode the lamplighter on a line, a tree, or a grid, respectively (&&&^^^^4 OR \4 OR \4^^^^&&&).

6. Automorphism groups, lexicographic products, and product actions

Wreath products enter graph theory not only as graph constructions but also as automorphism groups. If PRESERVED_PLACEHOLDER_^^^^4\4^^^^94 and PRESERVED_PLACEHOLDER_^^^^4\4^^^^95 are colored graphs, the composition PRESERVED_PLACEHOLDER_^^^^4\4^^^^96 has vertex set PRESERVED_PLACEHOLDER_^^^^4\4^^^^97, with inter-fibre edges determined by PRESERVED_PLACEHOLDER_^^^^4\4^^^^98 and intra-fibre edges determined by PRESERVED_PLACEHOLDER_^^^^4\4^^^^99. Its automorphism group always contains

PRESERVED_PLACEHOLDER_^^^^4 OR \4query4query4^^^^

in the natural imprimitive action. Conversely, if a vertex-transitive colored graph has automorphism group PRESERVED_PLACEHOLDER_^^^^4 OR \4query4\4^^^^ in the imprimitive action, then it is isomorphic to a composition PRESERVED_PLACEHOLDER_^^^^4 OR \4query4 OR \4^^^^ with PRESERVED_PLACEHOLDER_^^^^4 OR \4query4 OR \4^^^^ and PRESERVED_PLACEHOLDER_^^^^4 OR \4query44^^^^ (&&&^^^^4 OR \4 OR \4^^^^&&&).

The product action of wreath products on function sets PRESERVED_PLACEHOLDER_^^^^4 OR \4query4^^^^5 is more intricate. Subgroups of PRESERVED_PLACEHOLDER_^^^^4 OR \4query4^^^^6 in product action arise as automorphism groups of graph products, Hamming graphs, and codes. A structural theorem shows that, after conjugation by a base-group element, the component induced at a coordinate depends only on the orbit of that coordinate under the induced action on PRESERVED_PLACEHOLDER_^^^^4 OR \4query4^^^^7. If the action on PRESERVED_PLACEHOLDER_^^^^4 OR \4query4^^^^8 is transitive, the subgroup embeds into a smaller wreath product PRESERVED_PLACEHOLDER_^^^^4 OR \4query4^^^^9, where PRESERVED_PLACEHOLDER_^^^^4 OR \4\4query4^^^^ is one coordinate component and PRESERVED_PLACEHOLDER_^^^^4 OR \4\4\4^^^^ is the induced coordinate action (&&&^^^^4 OR \44^^^^&&&).

For highly symmetric graphs, this perspective becomes restrictive. If a connected PRESERVED_PLACEHOLDER_^^^^4 OR \4\4 OR \4^^^^-arc-transitive graph has vertex set PRESERVED_PLACEHOLDER_^^^^4 OR \4\4 OR \4^^^^ and PRESERVED_PLACEHOLDER_^^^^4 OR \4\44^^^^ is an innately transitive subgroup of PRESERVED_PLACEHOLDER_^^^^4 OR \4\4^^^^5 in product action with non-regular plinth, then either PRESERVED_PLACEHOLDER_^^^^4 OR \4\4^^^^6 is almost simple and the graph is one of exactly two examples—Sylvester’s Double Six graph on PRESERVED_PLACEHOLDER_^^^^4 OR \4\4^^^^7 vertices, or a graph on PRESERVED_PLACEHOLDER_^^^^4 OR \4\4^^^^8 vertices with automorphism group PRESERVED_PLACEHOLDER_^^^^4 OR \4\4^^^^9—or the inclusion is of type CD^^^^4 OR \4^^^^PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4query4^^^^ with non-simple plinth, a case for which no examples are presently known (&&&^^^^4 OR \4^^^^5&&&).

7. Quantum and operator-algebraic generalizations

Free wreath products of compact quantum groups extend the same pattern to noncommutative symmetry. The free inhomogeneous wreath product

PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4\4^^^^

is defined from compact matrix quantum groups PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4 OR \4^^^^ attached to the orbits PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4 OR \4^^^^ of a quantum permutation group PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \44^^^^. It is constructed from the free product of the PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^5 and PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^6, modulo commutation relations PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^7, and it carries a fundamental representation

PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^8

This generalizes both Bichon’s homogeneous free wreath product and the free product. It yields, for example,

PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4^^^^9

when the PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4query4^^^^ are connected graphs that are pairwise not quantum isomorphic (Bruyn et al., 18 Apr 2025).

The same paper develops a recursive “graph wreath product” description for connected graphs using the block tree of maximal biconnected subgraphs. At block nodes, the quantum automorphism group of the branch below the block is expressed as a free inhomogeneous wreath product of quantum stabilizers of child branches with the quantum automorphism group of the block. At cut vertices, the corresponding stabilizer is a free product of homogeneous free wreath products with quantum symmetric groups. This produces algorithms for forests, block graphs, and outerplanar graphs, under the hypothesis that quantum isomorphism coincides with graph isomorphism in the relevant class (Bruyn et al., 18 Apr 2025).

Operator-algebraic free wreath products admit an equally explicit graph model. For PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4\4^^^^, the full and reduced CPRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4 OR \4^^^^-algebras and the von Neumann algebra PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \4 OR \4^^^^ are realized as fundamental algebras of finite graphs of operator algebras. This yields an explicit Haar-state formula and stability results for exactness, the Haagerup property, hyperlinearity, and K-amenability. Under suitable hypotheses, the associated von Neumann algebra is a full prime factor without Cartan subalgebra, and the same framework gives explicit K-theory computations for quantum reflection groups PRESERVED_PLACEHOLDER_^^^^4 OR \4 OR \44^^^^ (Fima et al., 2023).

In this broader landscape, graph wreath products function less as a single definition than as a recurring architecture: graph-indexed families of local objects, coupled by a symmetry group or quantum symmetry, assembled into a global product whose algebraic, geometric, and combinatorial properties can often be computed from the underlying graph.