Pith

open record

sign in

arxiv: 2411.07812 · v1 · pith:DMLSPFVP · submitted 2024-11-12 · math.AC

Binomial edge rings of complete bipartite graphs

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:DMLSPFVPrecord.jsonopen to challenge →

classification math.AC
keywords binomialedgealgebragraphsringringsalgebrasbasis
0
0 comments X
read the original abstract

We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables generated by the binomials which correspond to $n$ edges. In this paper, we calculate a SAGBI basis for this algebra and obtain an initial algebra associated with this SAGBI basis in the case of complete bipartite graphs. It turns out that such an initial algebra is isomorphic to the Hibi ring of a certain poset. Similar phenomenon also occurs in the context of Pl\"{u}cker algebras, so the framework of binomial edge rings can be interpreted as a kind of its generalization.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.