BRP Class Reference

Boolean (F_2-coefficient) polynomial stored as an ordered list of square-free monomials. More...

#include <franzi-brp.hpp>

Public Member Functions
	BRP ()
	BRP (const monomials &other)
	BRP (const monomials_set &other)
	BRP (const brMonomial &val)
bool	isZero () const
bool	operator== (const brMonomial &val) const
bool	operator!= (const brMonomial &val) const
bool	operator== (const BRP &other) const
bool	operator!= (const BRP &other) const
BRP &	operator+ (const BRP &other)
void	addition (const BRP &other, monomials::iterator pos)
BRP	operator* (const BRP &other) const
BRP	operator* (const brMonomial &other) const
unsigned int	size () const
bool	isLeadingReducibleBy (const BRP &other) const
bool	isLeadingReducibleBy (const brMonomial &other) const
BRP	remainder (const BRP &x) const
brMonomial	LT () const
bool	reduceTail (const BRP &g)

Static Public Member Functions
static bool	isDivisibleBy (const brMonomial &a, const brMonomial &b)
static bool	isRelativelyPrime (const brMonomial &a, const brMonomial &b)

Public Attributes
monomials	m

Friends
std::ostream &	operator<< (std::ostream &out, const BRP &self)

Detailed Description

Boolean (F_2-coefficient) polynomial stored as an ordered list of square-free monomials.

Note

AI-generated documentation. Verify against the source before relying on it.

Coefficient ring is implicit (always 1 in F_2); the polynomial is just the symmetric-difference sum of the listed monomials. Underlying storage is a monomials (std::list<brMonomial>) kept sorted under the lex comparator declared above, so the leading term is m.front() and addition is a linear merge. Used by the Franzi GB code path for boolean polynomial rings.

Definition at line 74 of file franzi-brp.hpp.

---

The documentation for this class was generated from the following files:

• Macaulay2/e/franzi-brp.hpp
• Macaulay2/e/franzi-brp.cpp