Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 105 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 461 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Generalized splines on arbitrary graphs (1306.0801v2)

Published 4 Jun 2013 in math.CO and math.AT

Abstract: Let G be a graph whose edges are labeled by ideals of a commutative ring. We introduce a generalized spline, which is a vertex-labeling of G by elements of the ring so that the difference between the labels of any two adjacent vertices lies in the corresponding edge ideal. Generalized splines arise naturally in combinatorics (em algebraic splines of Billera and others) and in algebraic topology (certain equivariant cohomology rings, described by Goresky-Kottwitz-MacPherson and others). The central question of this manuscript asks when an arbitrary edge-labeled graph has nontrivial generalized splines. The answer is `always', and we prove the stronger result that generalized splines contain a free submodule whose rank is the number of vertices in G. We describe all generalized splines when G is a tree, and give several ways to describe the ring of generalized splines as an intersection of generalized splines for simpler subgraphs of G. We also present a new tool which we call the GKM matrix, an analogue of the incidence matrix of a graph, and end with open questions.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.