Generalized Integer Splines on Arbitrary Graphs
Combinatorics
2021-11-05 v1
Abstract
Generalized integer splines on a graph with integer edge weights are integer vertex labelings such that if two vertices share an edge in , 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.
Keywords
Cite
@article{arxiv.2111.02471,
title = {Generalized Integer Splines on Arbitrary Graphs},
author = {Lauren Rose and Jeff Suzuki},
journal= {arXiv preprint arXiv:2111.02471},
year = {2021}
}
Comments
20 pages, 8 figures