Minimum Generating Sets for Complete Graphs
From MaRDI portal
Abstract: Let be a graph whose edges are labeled by ideals of a commutative ring with identity. Such a graph is called an edge-labeled graph over . A generalized spline is a vertex labeling so that the difference between the labels of any two adjacent vertices lies in the ideal corresponding to the edge. These generalized splines form a module over . In this paper, we consider complete graphs whose edges are labeled with proper ideals of . We compute minimum generating sets of constant flow-up classes for spline modules on edge-labeled complete graphs over and their rank under some restrictions.
This page was built for publication: Minimum Generating Sets for Complete Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6372640)