On the ideal of orthogonal representations of a graph in R2
Abstract
In this paper, we study orthogonal representations of simple graphs G in Rd from an algebraic perspective in case d = 2. Orthogonal representations of graphs, introduced by Lov\'asz, are maps from the vertex set to Rd where non-adjacent vertices are sent to orthogonal vectors. We exhibit algebraic properties of the ideal generated by the equations expressing this condition and deduce geometric properties of the variety of orthogonal embeddings for d=2 and R replaced by an arbitrary field. In particular, we classify when the ideal is radical and provide a reduced primary decomposition if -1 ∈ K. This leads to a description of the variety of orthogonal embeddings as a union of varieties defined by prime ideals. In particular, this applies to the motivating case K = R.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.