A380571 Number of Dynkin systems on [n].

1, 1, 2, 5, 19, 137, 3708, 1506404, 230328505024

Offset

0,3

Comments

A Dynkin system on a set S is a subset of the power set of S which contains the empty set, is closed under complements in S, and is closed under union of disjoint sets.

Links

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

Martin Rubey and Peter Taylor, What is the number of finite Dynkin systems?, MathOverflow.

Wikipedia, Dynkin system

Formula

a(n) >= A000110(n).

Example

The a(3) = 5 systems are:
  {{}, {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}, {2,3}, {1,2,3}}
The a(4) = 19 systems are 15 sigma-algebras counted by A000110(4) and 4 other systems:
  {{}, {1,2,3,4}, {1,2}, {1,3}, {1,4}, {2,3}, {2,4}, {3,4}}
  {{}, {1,2,3,4}, {1,2}, {1,3}, {2,4}, {3,4}}
  {{}, {1,2,3,4}, {1,2}, {1,4}, {2,3}, {3,4}}
  {{}, {1,2,3,4}, {1,3}, {1,4}, {2,3}, {2,4}}

Crossrefs

Cf. A000110, A102894, A381471 (unlabeled case).

Sequence in context: A002786 A379707 A304982 * A039719 A332653 A198203

Adjacent sequences: A380568 A380569 A380570 * A380572 A380573 A380574

Keyword

nonn,hard,more

Author

Peter J. Taylor, Feb 24 2025

Status

approved