2000 character limit reached
Generalized Integer Splines on Arbitrary Graphs (2111.02471v1)
Published 3 Nov 2021 in math.CO
Abstract: Generalized integer splines on a graph $G$ with integer edge weights are integer vertex labelings such that if two vertices share an edge in $G$, the vertex labels are congruent modulo the edge weight. We introduce collapsing operations that reduce any simple graph to a single vertex, carrying with it the edge weight information. This corresponds to a sequence of surjective maps between the associated spline modules, leading to an explicit construction of a module basis in terms of the edge weights.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.