Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
1 problem
showing 1–1
Computations in some cases with n = 3 suggest that if S is a generating set for Γ0, then F1 = F0 and ⟨S⟩Γ is precisely the collection of points L of Γ for which there exists an i-element E of Δ(F0) such that L ⊂ E^⟂ (in Δ(F)) and L ∩ E ≠ ∅.