Macaulay2 » Documentation
Packages » BinomialEdgeIdeals :: BinomialEdgeIdeals
next | previous | forward | backward | up | index | toc

BinomialEdgeIdeals -- binomial edge ideals

Description

BinomialEdgeIdeals is a package for computations with binomial edge ideals

Literature

Author

Version

This documentation describes version 1.0 of BinomialEdgeIdeals.

Source code

The source code from which this documentation is derived is in the file BinomialEdgeIdeals.m2.

Exports

  • Functions and commands
  • Methods
    • binomialEdgeIdeal(List) -- see binomialEdgeIdeal -- Binomial edge ideals
    • disconnectors(List) -- see disconnectors -- Disconnectors of a graph
    • isDisconnector(List,List) -- see isDisconnector -- A test for being a disconnector
    • isDisconnector(List,Set) -- see isDisconnector -- A test for being a disconnector
    • isEffective(List,List) -- see isEffective -- A test for being an effective disconnector
    • isEffective(List,Set) -- see isEffective -- A test for being an effective disconnector
    • parityBinomialEdgeIdeal(List) -- see parityBinomialEdgeIdeal -- parity binomial edge ideals
    • weightedConnectedComponents(List) -- see weightedConnectedComponents -- Counting the weighted number of connected components of a graph
  • Symbols
    • EffectiveOnly (missing documentation)
    • Field (missing documentation)
    • Permanental (missing documentation)
    • TermOrder (missing documentation)
    • UseHypergraphs (missing documentation)
    • WeightMethod (missing documentation)

For the programmer

The object BinomialEdgeIdeals is a package.