On Jacobian group of the -graph
Abstract
In the present paper we compute the Jacobian group of -graph (n; k, l, m). The notion of -graph continues the list of families of I-, Y- and H-graphs well-known in the graph theory. In particular, graph (n; 1, 1, 1) is isomorphic to discrete torus C3× Cn. It this case, the structure of the Jacobian group will be find explicitly.
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.