Normal polytopes arising from finite graphs (Q1270039): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jabr.1998.7476 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1984810622 / rank | |||
Normal rank |
Revision as of 20:02, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Normal polytopes arising from finite graphs |
scientific article |
Statements
Normal polytopes arising from finite graphs (English)
0 references
2 December 1998
0 references
A symmetric relation on a set \(V=\{1,2, \dots, d\}\), i.e. a graph \(G\) possibly with loops but without multiple edges gives rise to a polytope in \(\mathbb{R}^d\) and to a subalgebra of \(K[t_1,t_2, \dots, t_d]\): The edge-polytope \(P_G\) is the convex hull of all points \(\vec e_i +\vec e_j\) in \(\mathbb{R}^d\), where \((i,j)\) is an edge of \(G\), and \(\vec e_i\) denotes the \(i\)th coordinate unit vector; the edge-ring \(K[G]\) is generated by all quadratic monomials \(t_i t_j\) where \((i,j)\) is an edge of \(G\). The main purpose of the article is to describe the normalization of the edge-ring \(K[G]\) explicitly in terms of combinatorics on \(G\), and to give a combinatorial criterion for the edge-polytope \(P_G\) to be normal, i.e. the subalgebra \(K[G]\) to be a normal domain. The main result of this interplay between algebra, geometry and combinatorics is the equivalence of the following conditions: (i) the edge-ring \(K[G]\) is normal (ii) the edge-polytope \(P_G\) possesses a unimodular covering (iii) the graph \(G\) satisfies the odd cycle condition.
0 references
normal domain
0 references
odd cycle condition
0 references