Toric ideals of weighted oriented graphs

DOI10.1142/S0218196722500151MaRDI QIDQ5063211zbMATH OpenOpenAlexFDO

Authors Jennifer Biermann, Selvi Kara, Kuei-Nuan Lin, Augustine O'keefe

Publication date 17 March 2022

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.04524

zbMATH Keywords

edge idealgraphtoric idealweighted digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of commutative algebra (05E40) General commutative ring theory and combinatorics (zero-divisor graphs, annihilating-ideal graphs, etc.) (13A70) Structure, classification theorems for modules and ideals in commutative rings (13C05) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Commutative rings defined by binomial ideals, toric rings, etc. (13F65) Toric varieties, Newton polyhedra, Okounkov bodies (14M25)

Abstract: Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which depends on the combinatorial structure and weights of the graph. We provide a result which is analogous to the unweighted, unoriented graph case, to show that when the associated simple graph has only trivial even closed walks, the toric ideal is the zero ideal. Moreover, we give necessary and sufficient conditions for the toric ideal of a weighted oriented graph to be generated by a single binomial and we describe the binomial in term of the structure of the graph.

Recommendations

• Equality of ordinary and symbolic powers of edge ideals of weighted oriented graphs
• Monomial ideals of weighted oriented graphs
• Oriented graphs whose toric ideals are a complete intersection
• Minimal generators of toric ideals of graphs
• Symbolic powers in weighted oriented graphs

Cites work

• Algebraic algorithms for sampling from conditional distributions
• Algebraic invariants of weighted oriented graphs
• Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
• Edge ideals of oriented graphs
• Hypergraph encodings of arbitrary toric ideals
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Monomial ideals of weighted oriented graphs
• Multi-Rees algebras and toric dynamical systems
• Rees algebras of edge ideals
• Symbolic powers of monomial ideals and Cohen-Macaulay vertex-weighted digraphs
• The maximum likelihood degree
• Toric algebra of hypergraphs
• Toric dynamical systems
• Toric ideals generalized by quadratic binomials

Cited in

(4)

• Toric varieties associated with weighted graphs
• Oriented graphs whose toric ideals are a complete intersection
• Cohen-Macaulay weighted oriented edge ideals and its Alexander dual
• Ordinary and symbolic powers of edge ideals of weighted oriented graphs

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: Toric ideals of weighted oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5063211)