BinomialEdgeIdeals -- binomial edge ideals

Description

BinomialEdgeIdeals is a package for computations with binomial edge ideals

Literature

[HHHTR2010] Binomial edge ideals and conditional independence statements (J. Herzog, T. Hibi, F. Hreinsdottir, T. Kahle, J. Rauh, 2010).
[HMMW2014] On the ideal of orthogonal representations of a graph in R^2 (J. Herzog, A. Macchia, S. Madani, V. Welker, 2014).
[KSW2015] Parity binomial edge ideals (T. Kahle, C. Sarmiento, T. Windisch, 2015)

Author

Tobias Windisch <[email protected]>

Version

This documentation describes version 1.0 of BinomialEdgeIdeals.

Citation

If you have used this package in your research, please cite it as follows:

@misc{BinomialEdgeIdealsSource,
  title = {{BinomialEdgeIdeals: A \emph{Macaulay2} package. Version~1.0}},
  author = {Tobias Windisch},
  howpublished = {A \emph{Macaulay2} package available at
    \url{https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages}}
}

Exports

Functions and commands
- bei -- Binomial edge ideal
- binomialEdgeIdeal -- Binomial edge ideals
- disconnectors -- Disconnectors of a graph
- isDisconnector -- A test for being a disconnector
- isEffective -- A test for being an effective disconnector
- parityBinomialEdgeIdeal -- parity binomial edge ideals
- pbei -- Parity binomial edge ideal
- weightedConnectedComponents -- Counting the weighted number of connected components of a graph
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, defined in BinomialEdgeIdeals.m2.

The source of this document is in BinomialEdgeIdeals.m2:174:0.