2018
DOI: 10.1007/978-3-319-95349-6_5
|View full text |Cite
|
Sign up to set email alerts
|

Edge Polytopes and Edge Rings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 27 publications
0
3
0
Order By: Relevance
“…However, G Q establishes a link to a different viewpoint. The quasi-independence ideals are also studied under the title of toric ideals of edge rings [33] and many combinatorial and algebraic aspects of these ideals are known [11]. Additionally the so-called edge polytopes, whose vertices are the columns of the incidence matrix of G Q , are introduced in [8] and their faces are characterized in terms of certain subgraphs of…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…However, G Q establishes a link to a different viewpoint. The quasi-independence ideals are also studied under the title of toric ideals of edge rings [33] and many combinatorial and algebraic aspects of these ideals are known [11]. Additionally the so-called edge polytopes, whose vertices are the columns of the incidence matrix of G Q , are introduced in [8] and their faces are characterized in terms of certain subgraphs of…”
Section: Preliminariesmentioning
confidence: 99%
“…Similar to the toric fiber product, we show that the Gröbner basis of I × Q J can be computed by lifting polynomials from the Gröbner bases of ideals I and J and adding in extra binomials which come from the monomial map φ Q . The Gröbner bases of the ideals I Q = ker(φ Q ) are completely known and have been studied in algebraic statistics [3,5] and commutative algebra as the toric ideals of edge rings of bipartite graphs [8,11,18,33]. Unlike the toric fiber product though, we allow for φ Q to be any monomial homomorphism which arises as the parameterization of a quasi-independence model and do not require that I and J are homogeneous with respect to multigradings.…”
Section: Introductionmentioning
confidence: 99%
“…Over decades, several lattice polytopes arising from graphs have been studied, extensively. Prominent examples include matching polytopes, cut polytopes, edge polytopes, adjacency polytopes of several types, among which are symmetric edge polytopes (see e.g., [23,4,19,21,28,10]). Following this line of research, in 2017, Braun and Meyer [6] initiated the study of Laplacian simplices that are defined as the convex hull of the columns of the classical Laplacian matrix of a simple graph (see also [24,3]).…”
Section: Introductionmentioning
confidence: 99%