Toric rings, inseparability and rigidity
Mina Bigdeli, J\"urgen Herzog, Dancheng Lu

TL;DR
This paper studies infinitesimal deformations of toric rings, providing explicit descriptions of their deformation spaces, and explores properties like inseparability and rigidity, with applications to graph edge rings and convex polyominoes.
Contribution
It offers an explicit description of the cotangent module for toric rings, introduces the concepts of inseparability and semi-rigidity, and applies these to graph edge rings and convex polyominoes.
Findings
Convex polyomino coordinate rings are inseparable.
Complete bipartite graphs with one edge removed are rigid for certain parameters.
Introduces semi-rigidity and characterizes graphs with semi-rigid edge rings.
Abstract
This article provides the basic algebraic background on infinitesimal deformations and presents the proof of the well-known fact that the non-trivial infinitesimal deformations of a -algebra are parameterized by the elements of cotangent module of . In this article we focus on deformations of toric rings, and give an explicit description of in the case that is a toric ring. In particular, we are interested in unobstructed deformations which preserve the toric structure. Such deformations we call separations. Toric rings which do not admit any separation are called inseparable. We apply the theory to the edge ring of a finite graph. The coordinate ring of a convex polyomino may be viewed as the edge ring of a special class of bipartite graphs. It is shown that the coordinate ring of any convex polyomino is inseparable. We introduce the concept of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Algebraic structures and combinatorial models
