skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Generalized Splines on Graphs with Two Labels and Polynomial Splines on Cycles
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The former consists of piecewise polynomials on a combinatorial geometric object like a polytope, whose polynomial pieces agree to a specified degree of differentiability. The latter is a graph-theoretic construction of torus-equivariant cohomology that Shareshian and Wachs used to reformulate the well-known Stanley-Stembridge conjecture, a reformulation that was recently proven to hold by Brosnan and Chow and independently Guay-Paquet. This paper focuses on the theory of generalized splines. A generalized spline on a graph $$G$$ with each edge labeled by an ideal in a ring $$R$$ consists of a vertex-labeling by elements of $$R$$ so that the labels on adjacent vertices $u, v$ differ by an element of the ideal associated to the edge $uv$. We study the $$R$$-module of generalized splines and produce minimum generating sets for several families of graphs and edge-labelings: $1)$ for all graphs when the set of possible edge-labelings consists of at most two finitely-generated ideals, and $2)$ for cycles when the set of possible edge-labelings consists of principal ideals generated by elements of the form $(ax+by)^2$ in the polynomial ring $$\mathbb{C}[x,y]$$. We obtain the generators using a constructive algorithm that is suitable for computer implementation and give several applications, including contextualizing several results in the theory of classical (analytic) splines.  more » « less
Award ID(s):
2054513
PAR ID:
10566435
Author(s) / Creator(s):
; ;
Publisher / Repository:
Electronic Journal of Combinatorics
Date Published:
Journal Name:
The Electronic Journal of Combinatorics
Volume:
31
Issue:
1
ISSN:
1077-8926
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. (, Forum of Mathematics, Sigma)
    Abstract A spline is an assignment of polynomials to the vertices of a graph whose edges are labeled by ideals, where the difference of two polynomials labeling adjacent vertices must belong to the corresponding ideal. The set of splines forms a ring. We consider spline rings where the underlying graph is the Cayley graph of a symmetric group generated by a collection of transpositions. These rings generalize the GKM construction for equivariant cohomology rings of flag, regular semisimple Hessenberg and permutohedral varieties. These cohomology rings carry two actions of the symmetric group$$S_n$$whose graded characters are both of general interest in algebraic combinatorics. In this paper, we generalize the graded$$S_n$$-representations from the cohomologies of the above varieties to splines on Cayley graphs of$$S_n$$and then (1) give explicit module and ring generators for whenever the$$S_n$$-generating set is minimal, (2) give a combinatorial characterization of when graded pieces of one$$S_n$$-representation is trivial, and (3) compute the first degree piece of both graded characters for all generating sets. 
    more » « less
  2. ; ; ; ; (, Journal of Algebraic Combinatorics)
    Abstract In this paper, we investigate the degree ofh-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of theh-polynomial for various fundamental classes of graphs such as paths, cycles, and bipartite graphs. To the best of our knowledge, this study represents the first investigation into the combinatorial interpretation of this algebraic invariant. Additionally, we characterize all connected graphs in which the sum of the Castelnuovo–Mumford regularity and the degree of theh-polynomial of an edge ideal achieve its maximum value, equal to the number of vertices in the graph. 
    more » « less
  3. (, Nagoya Mathematical Journal)
    Abstract In this paper, we prove that a classical theorem by McAdam about the analytic spread of an ideal in a Noetherian local ring continues to be true for divisorial filtrations on a two-dimensional normal excellent local ring R , and that the Hilbert polynomial of the fiber cone of a divisorial filtration on R has a Hilbert function which is the sum of a linear polynomial and a bounded function. We prove these theorems by first studying asymptotic properties of divisors on a resolution of singularities of the spectrum of R . The filtration of the symbolic powers of an ideal is an example of a divisorial filtration. Divisorial filtrations are often not Noetherian, giving a significant difference in the classical case of filtrations of powers of ideals and divisorial filtrations. 
    more » « less
  4. ; ; (, Annals of Combinatorics)
    We define a far-reaching generalization of Schnyder woods which encompasses many classical combinatorial structures on planar graphs. Schnyder woods are defined for planar triangulations as certain triples of spanning trees covering the triangulation and crossing each other in an orderly fashion. They are of theo- retical and practical importance, as they are central to the proof that the order dimension of any planar graph is at most 3, and they are also underlying an elegant drawing algorithm. In this article we extend the concept of Schnyder wood well beyond its original setting: for any integer d ≥ 3 we define a “grand-Schnyder” structure for (embedded) planar graphs which have faces of degree at most d and non-facial cycles of length at least d. We prove the existence of grand-Schnyder structures, provide a linear construction algorithm, describe 4 different incarnations (in terms of tuples of trees, corner labelings, weighted orientations, and marked orientations), and define a lattice for the set of grand Schnyder structures of a given planar graph. We show that the grand-Schnyder framework unifies and extends several clas- sical constructions: Schnyder woods and Schnyder decompositions, regular edge-labelings (a.k.a. transversal structures), and Felsner woods. 
    more » « less
  5. ; ; ; ; ; ; ; ; ; ; et al (, Journal of Algebra and Its Applications)
    Principal symmetric ideals were recently introduced by Harada et al. in [The minimal free resolution of a general principal symmetric ideal, preprint (2023), arXiv:2308.03141], where their homological properties are elucidated. They are ideals generated by the orbit of a single polynomial under permutations of variables in a polynomial ring. In this paper, we determine when a product of two principal symmetric ideals is principal symmetric and when the powers of a principal symmetric ideal are again principal symmetric ideals. We characterize the ideals that have the latter property as being generated by polynomials invariant up to a scalar multiple under permutation of variables. Recognizing principal symmetric ideals is an open question for the purpose of which we produce certain obstructions. We also demonstrate that the Hilbert functions of symmetric monomial ideals are not all given by symmetric monomial ideals, in contrast to the non-symmetric case. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email