Search arXivSearch

arXiv · 1306.0801

Generalized splines on arbitrary graphs

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simcha Gilbert, Shira Polster, Julianna Tymoczko. 2015-08-24. Generalized splines on arbitrary graphs. https://doi.org/10.2140/pjm.2016.281.333

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO