• Corpus ID: 233481825

Cycle algebras and polytopes of matroids

  title={Cycle algebras and polytopes of matroids},
  author={Tim Romer and Sara Saeedi Madani},
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an algebraic and geometric investigation of these polytopes by studying their toric algebras, called cycle algebras, and their defining ideals. Several matroid operations are considered which determine faces of cycle polytopes that belong again to this class of… 

Figures from this paper

Classes of cut ideals and their Betti numbers
We study monomial cut ideals associated to a graph G, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and


Toric geometry of cuts and splits
Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and
Retracts and algebraic properties of cut algebras
The key idea is to consider suitable retracts to understand algebraic properties and invariants of such algebras like being a complete intersection, having a linear resolution, or the Castelnuovo-Mumford regularity.
A Note on Seminormality of Cut Polytopes
We prove that seminormality of cut polytopes is equivalent to normality. This settles two conjectures regarding seminormality of cut polytopes.
Invitation to Nonlinear Algebra
  • Graduate Studies in Mathematics
  • 2021
Generalized cut and metric polytopes of graphs and simplicial complexes
The metric polytope METP of the complete graph on n nodes is defined by the triangle inequalities and the facets of the cut polytopes are studied here in some detail for many simple graphs.
Cut Polytopes of Minor-free Graphs
The facet-description of cut polytopes of K_{3,3}$-minor-free graphs are given and an algorithm solving MaxCut on those graphs is introduced, which only requires the running time of planar MaxCut.
Algebra retracts and Stanley-Reisner rings
Abstract In a paper from 2002, Bruns and Gubeladze conjectured that graded algebra retracts of polytopal algebras over a field k are again polytopal algebras. Motivated by this conjecture, we prove
Gorenstein cut polytopes
  • H. Ohsugi
  • Computer Science, Mathematics
    Eur. J. Comb.
  • 2014
It is shown that a cut polytope of a graph G is Gorenstein if and only if G has no K"5-minor and G is either a bipartite graph without induced cycles of length >=6 or a bridgeless chordal graph.
Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Whitney's definition em- braces a surprising diversity of combinatorial structures. Moreover, ma-
A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
The theta bodies of the vanishing ideal of cycles in a binary matroid are constructed and applied to cuts in graphs, this yields a new hierarchy of semidefinite programming relaxations of the cut polytope of the graph.