Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A327040

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of set-systems covering n vertices, every two of which appear together in some edge (cointersecting).
(history; published version)
#9 by N. J. A. Sloane at Sun Oct 22 16:49:34 EDT 2023
STATUS

proposed

approved

#8 by Christian Sievers at Sun Oct 22 15:23:32 EDT 2023
STATUS

editing

proposed

#7 by Christian Sievers at Sun Oct 22 15:21:35 EDT 2023
DATA

1, 1, 4, 72, 25104, 2077196832, 9221293229809363008, 170141182628636920877978969957369949312

EXTENSIONS

a(5)-a(7) from Christian Sievers, Oct 22 2023

STATUS

approved

editing

Discussion
Sun Oct 22
15:23
Christian Sievers: computed using BDDs
#6 by Joerg Arndt at Sun Aug 18 11:27:31 EDT 2019
STATUS

proposed

approved

#5 by Gus Wiseman at Sun Aug 18 11:16:16 EDT 2019
STATUS

editing

proposed

#4 by Gus Wiseman at Sun Aug 18 11:13:47 EDT 2019
CROSSREFS

The non-covering case version is A327039.

#3 by Gus Wiseman at Sun Aug 18 11:11:41 EDT 2019
COMMENTS

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. The dual of a set-system has, for each vertex, one edge consisting of the indices (or positions) of the edges containing that vertex. For example, the dual of {{1,2},{2,3}} is {{1},{1,2},{2}}. This sequence counts covering set-systems that are cointersecting, meaning their dual is pairwise intersecting.

#2 by Gus Wiseman at Sun Aug 18 01:51:22 EDT 2019
NAME

allocated for Gus WisemanNumber of set-systems covering n vertices, every two of which appear together in some edge (cointersecting).

DATA

1, 1, 4, 72, 25104

OFFSET

0,3

COMMENTS

A set-system is a finite set of finite nonempty sets. The dual of a set-system has, for each vertex, one edge consisting of the indices (or positions) of the edges containing that vertex. For example, the dual of {{1,2},{2,3}} is {{1},{1,2},{2}}. This sequence counts covering set-systems that are cointersecting, meaning their dual is pairwise intersecting.

FORMULA

Inverse binomial transform of A327039.

EXAMPLE

The a(0) = 1 through a(2) = 4 set-systems:

{} {{1}} {{1,2}}

{{1},{1,2}}

{{2},{1,2}}

{{1},{2},{1,2}}

MATHEMATICA

dual[eds_]:=Table[First/@Position[eds, x], {x, Union@@eds}];

stableQ[u_, Q_]:=!Apply[Or, Outer[#1=!=#2&&Q[#1, #2]&, u, u, 1], {0, 1}];

Table[Length[Select[Subsets[Subsets[Range[n], {1, n}]], Union@@#==Range[n]&&stableQ[dual[#], Intersection[#1, #2]=={}&]&]], {n, 0, 3}]

CROSSREFS

The unlabeled multiset partition version is A319752.

The BII-numbers of these set-systems are A326853.

The antichain case is A327020.

The pairwise intersecting case is A327037.

The non-covering case is A327039.

The case where the dual is strict is A327053.

Cf. A003465, A305843, A305844, A306006, A319774, A327052.

KEYWORD

allocated

nonn,more

AUTHOR

Gus Wiseman, Aug 18 2019

STATUS

approved

editing

#1 by Gus Wiseman at Fri Aug 16 07:19:12 EDT 2019
NAME

allocated for Gus Wiseman

KEYWORD

allocated

STATUS

approved