REVIEW 1 cited by
Binomial edge rings of complete bipartite graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 1 Pith paper
-
Binomial edge rings associated to skew Ferrers diagrams
For every skew Ferrers bipartite graph, the binomial edge ring has a quadratic Sagbi/Grobner presentation, is Koszul, Cohen Macaulay, normal, and its dimension is the number of NW and SE perimeter cells.
Discussion (0). Continue with ORCID to comment.