Universal Structure of Graph Product Kernels

Abstract

Let G be a graph product over a finite simplicial graph , and let K denote the kernel of the canonical homomorphism from G to the direct product of its vertex groups. It is known that, up to isomorphism, K depends only on the underlying graph and the cardinalities of the vertex groups. In this paper we establish a functorial refinement of this fact. We show that any collection of set maps between the vertex groups naturally induces a homomorphism between the corresponding kernels, and that this construction is functorial. Several applications are discussed.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…