next | previous | forward | backward | up | top | index | toc | Macaulay2 web site

BinomialEdgeIdeals :: BinomialEdgeIdeals

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 <windisch@ovgu.de>

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
- 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
Symbols
- EffectiveOnly (missing documentation)
- Field (missing documentation)
- Permanental (missing documentation)
- TermOrder (missing documentation)
- UseHypergraphs (missing documentation)
- WeightMethod (missing documentation)