deal with BooleanMonomialMonoid in polynomial sequences
Reported by Mate Soos:
As of Sage 5.5, Sequence
s of polynomials offers special methods:
sage: B.<a,b,c,d> = GF(2)[]
sage: F0 = Sequence(map(lambda f: f.lm(),[a,b,c,d]))
sage: F0.groebner_basis()
[a, b, c, d]
However, Sequence
s of *boolean* polynomials lack these special methods:
sage: B.<a,b,c,d> = BooleanPolynomialRing()
sage: F0 = Sequence(map(lambda f: f.lm(),[a,b,c,d]))
sage: F0.groebner_basis()
...
AttributeError: 'Sequence_generic' object has no attribute 'groebner_basis'
Change History (9)
Cc: 
Charles Bouillaguet added

Description: 
modified (diff)

Milestone: 
sage5.11 →
sage5.12

Milestone: 
sage6.1 →
sage6.2

Milestone: 
sage6.2 →
sage6.3

Milestone: 
sage6.3 →
sage6.4

Branch: 
→ u/tmonteil/deal_with_booleanmonomialmonoid_in_polynomial_sequences

Authors: 
→ Thierry Monteil

Commit: 
→ 3fd8230751697d42873cddebbbc8dbdcd53f0b97

Status: 
new →
needs_review

Milestone: 
sage6.4 →
sage8.1

Reviewers: 
→ Travis Scrimshaw

Status: 
needs_review →
positive_review

Branch: 
u/tmonteil/deal_with_booleanmonomialmonoid_in_polynomial_sequences →
3fd8230751697d42873cddebbbc8dbdcd53f0b97

Resolution: 
→ fixed

Status: 
positive_review →
closed

This defect fixed itself with the time. Let me just add a corresponding doctest to avoid future regression.
New commits:
#10680 : test Groebner basis of sequences of boolean polynomials.