English

Integer Generalized Splines on Cycles

Combinatorics 2014-09-05 v1

Abstract

Let G be a graph whose edges are labeled by positive integers. Label each vertex with an integer and suppose if two vertices are joined by an edge, the vertex labels are congruent to each other modulo the edge label. The set of vertex labels satisfying this condition is called a generalized spline. Gilbert, Polster, and Tymoczko recently defined generalized splines based on work on polynomial splines by Billera, Rose, Haas, Goresky-Kottwitz-Machperson, and many others. We focus on generalized splines on nn-cycles. We construct a particularly nice basis for the module of splines on nn-cycles. As an application, we construct generalized splines on star graphs, wheel graphs, and complete graphs.

Keywords

Cite

@article{arxiv.1409.1481,
  title  = {Integer Generalized Splines on Cycles},
  author = {Madeline Handschy and Julie Melnick and Stephanie Reinders},
  journal= {arXiv preprint arXiv:1409.1481},
  year   = {2014}
}

Comments

24 pages, 7 figures

R2 v1 2026-06-22T05:48:42.595Z