Skip to content
Preprint

Weak Factorization and Product Systems Over Groupoids

Aug 2026 · 0 citations · 5 references
Mathematics

Abstract

We give a product-system description of generalized higher-rank graphs with the weak factorization property. For such a graph with degree-zero groupoid G, we prove that weak factorization is equivalent to multiplication inducing coherent bijections between balanced products of its homogeneous G-G-bisets. Consequently, generalized higher-rank graphs with fixed degree-zero groupoid are equivalent to normalized product systems of groupoid bisets over N^k. For countable left-cancellative graphs, these bisets linearize canonically to product systems of C*(G)-correspondences. Finite alignment implies compact alignment, and the resulting Nica-Toeplitz algebra agrees canonically with Spielberg's full category algebra. Under row-finiteness modulo G and the no-sources condition, the corresponding Cuntz-Pimsner quotient is the boundary groupoid algebra; with injective left actions, the same conclusion holds for the Cuntz-Nica-Pimsner algebra. We also characterize the R-condition by the existence of a strict multiplicative splitting and relate such splittings to higher-rank graph/groupoid Zappa-Szep products. A cancellative rank-two example shows that strict splittings need not exist.

View source

Similar papers

Preprint Aug 2026

Exact Factorizations of Rank-One Pointed Hopf Algebras in Positive Characteristic, I

We classify exact factorizations of the third-type rank-one pointed Hopf algebras over an algebraically closed field of positive characteristic. The main step is a complete classification of matched pairs between such an algebra and a group algebra. It turns out that the group-like part must form a matched pair of fini...

Rong-Chuan Xiong · 0 citations
Preprint Aug 2026

Matchings and product growth in modular abelian independence groups

We unify two matching theories, one for finite subsets of groups and the other for finite-dimensional subspaces in a field extension. To achieve this, we study groups equipped with a compatible finitary matroid structure, termed here independence groups. Applying Rado's independent transversal theorem, we derive necess...

Mohsen Aliabadi, Jozsef Losonczy · 0 citations
Preprint Sep 2026

Direct-product rigidity and factor reconstruction for monoids with zero

We study direct products of monoids with zero and give a criterion under which their factors can be recovered from the multiplicative structure alone. While classical decomposition theory encodes direct products through factor congruences, central elements, and refinement properties, we give a concrete multiplicative r...

Joseph Atalaye, Liam Baker, Sophie Marques · 0 citations
Preprint Sep 2026

Von Neumann algebras as reduced twisted groupoid $C^*$-algebras

We characterize the von Neumann algebras that are isomorphic, as $C^*$-algebras, to reduced twisted $C^*$-algebras of locally compact Hausdorff groupoids equipped with continuous Haar systems of full support. They are exactly the subhomogeneous von Neumann algebras, equivalently finite products of matrix algebras over...

Alcides Buss, Luiz Felipe Garcia, T. Pacheco · 1 citation
Preprint Oct 2026

Finite-dimensional approximations for C*-algebras of product systems

We study C*-algebras generated by representations of product systems over unital subsemigroups of amenable discrete groups. In the first part, we show that exactness of the generated C*-algebra is equivalent to exactness of the cores over the constructible ideals. Nuclearity of the generated C*-algebra is equivalent to...

E. Kakariadis, I. Paraskevas · 0 citations
Preprint Sep 2026

Gallai Decomposition of Ordered Groups: Subgroups, Quotients, and the $N$-free Case

We study Gallai decomposition for groups equipped with two-sided invariant partial orders. The key algebraic step extends to arbitrary binary relations compatible with the group operation: if all left and right translations preserve a binary relation $\rho$, then every least strong module $S_{\rho}(\e,g)$, $g\ne\e$, is...

Imed Zaguia · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.