Binomial edge rings of complete bipartite graphs
Commutative Algebra
2024-11-13 v1
Abstract
We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph on vertices with edges, the binomial edge ring of is defined to be the subalgebra of the polynomial ring with variables generated by the binomials which correspond to 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.
Cite
@article{arxiv.2411.07812,
title = {Binomial edge rings of complete bipartite graphs},
author = {Akihiro Higashitani},
journal= {arXiv preprint arXiv:2411.07812},
year = {2024}
}
Comments
12 pages, 3 figures