A358152 Number of strict closure operators on a set of n elements such that every point and every set not containing that point can be separated by clopen sets.

1, 1, 2, 8, 121

Offset

0,3

Comments

A closure operator is strict if the empty set is closed.

A point p in X and a subset A of X not containing p are separated by a set H if p is an element of H and A is a subset of X\H.

Also the number of S_3 convexities on a set of n elements in the sense of Chepoi.

References

G. M. Bergman, "Lattices, Closure Operators, and Galois Connections", pp. 173-212 in "An Invitation to General Algebra and Universal Constructions", Springer, (2015).

Links

Table of n, a(n) for n=0..4.

Victor Chepoi, Separation of Two Convex Sets in Convexity Structures

Example

The a(3) = 8 set-systems of closed sets:
  {{}, {1, 2, 3}}
  {{}, {1}, {2, 3}, {1, 2, 3}}
  {{}, {2}, {1, 3},{1, 2, 3}}
  {{}, {3}, {1, 2}, {1, 2, 3}}
  {{}, {1}, {2}, {3}, {1, 2}, {1, 3}, {1, 2, 3}}
  {{}, {1}, {2}, {3}, {1, 2}, {2, 3}, {1, 2, 3}}
  {{}, {1}, {2}, {3}, {1, 3}, {2, 3}, {1, 2, 3}}
  {{}, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}

Mathematica

SeparatedPairQ[F_, n_] := AllTrue[
  Flatten[(x |-> ({x, #} & /@ Select[F, FreeQ[#, x] &])) /@ Range[n],
  1], MemberQ[F,
  _?(H |-> With[{H1 = Complement[Range[n], H]},
      MemberQ[F, H1] && MemberQ[H, #[[1]]
] && SubsetQ[H1, #[[2]]
]])]&];
Table[Length@Select[Select[
   Subsets[Subsets[Range[n]]],
   And[
     MemberQ[#, {}],
     MemberQ[#, Range[n]],
     SubsetQ[#, Intersection @@@ Tuples[#, 2]]] &
   ], SeparatedPairQ[#, n] &], {n, 0, 4}]

Crossrefs

Cf. A334255, A358144, A356544.

Sequence in context: A112094 A009658 A147794 * A027530 A228064 A271846

Adjacent sequences: A358149 A358150 A358151 * A358153 A358154 A358155

Keyword

nonn,hard,more

Author

Tian Vlasic, Nov 01 2022

Status

approved