A326360 -id:A326360 - cp's OEIS frontend

A326358 Number of maximal antichains of subsets of {1..n}.

1, 2, 3, 7, 29, 376, 31746, 123805914

Offset: 0

Gus Wiseman, Jul 01 2019

A set system (set of sets) is an antichain if no element is a subset of any other.

			The a(0) = 1 through a(3) = 7 maximal antichains:
  {}  {}   {}      {}
      {1}  {12}    {123}
           {1}{2}  {1}{23}
                   {2}{13}
                   {3}{12}
                   {1}{2}{3}
                   {12}{13}{23}

Denis Bouyssou, Thierry Marchant, and Marc Pirlot, ELECTRE TRI-nB, pseudo-disjunctive: axiomatic and combinatorial results, arXiv:2410.18443 [cs.DM], 2024. See p. 14.
Dmitry I. Ignatov, A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions. In: Ojeda-Aciego, M., Sauerwald, K., Jäschke, R. (eds) Graph-Based Representation and Reasoning. ICCS 2023. Lecture Notes in Computer Science(). Springer, Cham.
Dmitry I. Ignatov, On the Number of Maximal Antichains in Boolean Lattices for n up to 7. Lobachevskii J. Math., 44 (2023), 137-146.

Antichains of sets are A000372.
Minimal covering antichains are A046165.
Maximal intersecting antichains are A007363.
Maximal antichains of nonempty sets are A326359.
Cf. A003182, A006126, A006602, A014466, A058891, A261005, A305000, A305001, A305844, A326360, A326361, A326362, A326363.

LoadPackage("grape");
      maxachP:=function(n) local g,G;
       g:=Graph(Group(()), Combinations([1..n]), function(x, g) return x; end,
          function(x, y) return not IsSubset(x, y) and not IsSubset(y, x); end, true);
       G:=AutGroupGraph(g);
       return Sum(CompleteSubgraphs(NewGroupGraph(G, g), -1, 2),
              function(c) return Length(Orbit(G, c, OnSets)); end);
     end;
       List([0..7],maxachP); # Mamuka Jibladze, Jan 26 2021

stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
fasmax[y_]:=Complement[y,Union@@(Most[Subsets[#]]&/@y)];
Table[Length[fasmax[stableSets[Subsets[Range[n]],SubsetQ]]],{n,0,5}]
(* alternatively *)
maxachP[n_]:=FindIndependentVertexSet[
  Flatten[Map[Function[s, Map[# \[DirectedEdge] s &, Most[Subsets[s]]]],
    Subsets[Range[n]]]], Infinity, All];
Table[Length[maxachP[n]],{n,0,6}] (* Mamuka Jibladze, Jan 25 2021 *)

For n > 0, a(n) = A326359(n) + 1.

a(6)-a(7) from Mamuka Jibladze, Jan 26 2021

A326363 Number of maximal intersecting antichains of subsets of {1..n}.

Original entry on oeis.org

1, 2, 4, 6, 21, 169, 11749, 12160648

Offset: 0

Gus Wiseman, Jul 01 2019

A set system (set of sets) is an antichain if no element is a subset of any other, and is intersecting if no two element are disjoint.

			The a(1) = 1 through a(4) = 21 maximal intersecting antichains:
  {}   {}    {}            {}
  {1}  {1}   {1}           {1}
       {2}   {2}           {2}
       {12}  {3}           {3}
             {123}         {4}
             {12}{13}{23}  {1234}
                           {12}{13}{23}
                           {12}{14}{24}
                           {13}{14}{34}
                           {23}{24}{34}
                           {12}{134}{234}
                           {13}{124}{234}
                           {14}{123}{234}
                           {23}{124}{134}
                           {24}{123}{134}
                           {34}{123}{124}
                           {12}{13}{14}{234}
                           {12}{23}{24}{134}
                           {13}{23}{34}{124}
                           {14}{24}{34}{123}
                           {123}{124}{134}{234}

The case with nonempty, non-singleton edges is A326362.
Antichains of nonempty, non-singleton sets are A307249.
Minimal covering antichains are A046165.
Maximal intersecting antichains are A007363.
Maximal antichains of nonempty sets are A326359.
Cf. A000372, A003182, A006126, A006602, A014466, A051185, A058891, A261005, A305000, A305844, A326358, A326360, A326361.

stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
fasmax[y_]:=Complement[y,Union@@(Most[Subsets[#]]&/@y)];
Table[Length[fasmax[stableSets[Subsets[Range[n],{0,n}],Or[Intersection[#1,#2]=={},SubsetQ[#1,#2]]&]]],{n,0,5}]
(* 2nd program *)
n = 2^6; g = CompleteGraph[n]; i = 0;
While[i < n, i++; j = i; While[j < n, j++; If[BitAnd[i, j] == 0 || BitAnd[i, j] == i || BitAnd[i, j] == j, g = EdgeDelete[g, i <-> j]]]];
sets = FindClique[g, Infinity, All];
Length[sets] (* Elijah Beregovsky, May 06 2020 *)

For n > 1, a(n) = A007363(n + 1) + 1 = A326362(n) + n + 1.

a(7) from Elijah Beregovsky, May 06 2020

A326359 Number of maximal antichains of nonempty subsets of {1..n}.

Original entry on oeis.org

1, 1, 2, 6, 28, 375, 31745, 123805913

Offset: 0

Gus Wiseman, Jul 01 2019

A set system (set of sets) is an antichain if no element is a subset of any other.

			The a(0) = 1 through a(4) = 28 antichains:
  {}   {1}    {12}      {123}           {1234}
              {1}{2}    {1}{23}         {1}{234}
                        {2}{13}         {2}{134}
                        {3}{12}         {3}{124}
                        {1}{2}{3}       {4}{123}
                        {12}{13}{23}    {1}{2}{34}
                                        {1}{3}{24}
                                        {1}{4}{23}
                                        {2}{3}{14}
                                        {2}{4}{13}
                                        {3}{4}{12}
                                        {1}{2}{3}{4}
                                        {12}{134}{234}
                                        {13}{124}{234}
                                        {14}{123}{234}
                                        {23}{124}{134}
                                        {24}{123}{134}
                                        {34}{123}{124}
                                        {1}{23}{24}{34}
                                        {2}{13}{14}{34}
                                        {3}{12}{14}{24}
                                        {4}{12}{13}{23}
                                        {12}{13}{14}{234}
                                        {12}{23}{24}{134}
                                        {13}{23}{34}{124}
                                        {14}{24}{34}{123}
                                        {123}{124}{134}{234}
                                        {12}{13}{14}{23}{24}{34}

Dmitry I. Ignatov, On the Number of Maximal Antichains in Boolean Lattices for n up to 7. Lobachevskii J. Math., 44 (2023), 137-146.

Antichains of nonempty sets are A014466.
Minimal covering antichains are A046165.
Maximal intersecting antichains are A007363.
Maximal antichains of sets are A326358.
Cf. A000372, A003182, A006126, A006602, A014466, A058891, A261005, A305000, A305844, A307249, A326360, A326362, A326363.

stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
fasmax[y_]:=Complement[y,Union@@(Most[Subsets[#]]&/@y)];
Table[Length[fasmax[stableSets[Subsets[Range[n],{1,n}],SubsetQ]]],{n,0,5}]

For n > 0, a(n) = A326358(n) - 1.

a(6) from Andrew Howroyd, Aug 14 2019

a(7) from Dmitry I. Ignatov, Oct 12 2021

A326361 Number of maximal intersecting antichains of sets covering n vertices with no singletons.

Original entry on oeis.org

1, 1, 1, 2, 12, 133, 11386, 12143511

Offset: 0

Gus Wiseman, Jul 01 2019

Covering means there are no isolated vertices. A set system (set of sets) is an antichain if no part is a subset of any other, and is intersecting if no two parts are disjoint.

			The a(4) = 12 antichains:
  {{1,2,3,4}}
  {{1,2},{1,3,4},{2,3,4}}
  {{1,3},{1,2,4},{2,3,4}}
  {{1,4},{1,2,3},{2,3,4}}
  {{2,3},{1,2,4},{1,3,4}}
  {{2,4},{1,2,3},{1,3,4}}
  {{3,4},{1,2,3},{1,2,4}}
  {{1,2},{1,3},{1,4},{2,3,4}}
  {{1,2},{2,3},{2,4},{1,3,4}}
  {{1,3},{2,3},{3,4},{1,2,4}}
  {{1,4},{2,4},{3,4},{1,2,3}}
  {{1,2,3},{1,2,4},{1,3,4},{2,3,4}}

Antichains of nonempty, non-singleton sets are A307249.
Minimal covering antichains are A046165.
Maximal intersecting antichains are A007363.
Maximal antichains of nonempty sets are A326359.
Cf. A000372, A003182, A006126, A006602, A014466, A051185, A058891, A261005, A305000, A305844, A326358, A326360, A326362, A326363.

stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
fasmax[y_]:=Complement[y,Union@@(Most[Subsets[#]]&/@y)];
Table[Length[fasmax[Select[stableSets[Subsets[Range[n]],Or[Intersection[#1,#2]=={},SubsetQ[#1,#2]]&],Union@@#==Range[n]&]]],{n,0,5}]
(* 2nd program *)
n = 2^6; g = CompleteGraph[n]; i = 0;
While[i < n, i++; j = i; While[j < n, j++; If[BitAnd[i, j] == 0 || BitAnd[i, j] == i || BitAnd[i, j] == j, g = EdgeDelete[g, i <-> j]]]];
sets = Select[FindClique[g, Infinity, All], BitOr @@ # == n - 1 &];
Length[sets] (* Elijah Beregovsky, May 05 2020 *)

a(6)-a(7) from Elijah Beregovsky, May 05 2020

A326362 Number of maximal intersecting antichains of nonempty, non-singleton subsets of {1..n}.

Original entry on oeis.org

1, 1, 1, 2, 16, 163, 11742, 12160640

Offset: 0

Gus Wiseman, Jul 01 2019

A set system (set of sets) is an antichain if no part is a subset of any other, and is intersecting if no two parts are disjoint.

			The a(4) = 16 maximal intersecting antichains:
  {{1,2,3,4}}
  {{1,2},{1,3},{2,3}}
  {{1,2},{1,4},{2,4}}
  {{1,3},{1,4},{3,4}}
  {{2,3},{2,4},{3,4}}
  {{1,2},{1,3,4},{2,3,4}}
  {{1,3},{1,2,4},{2,3,4}}
  {{1,4},{1,2,3},{2,3,4}}
  {{2,3},{1,2,4},{1,3,4}}
  {{2,4},{1,2,3},{1,3,4}}
  {{3,4},{1,2,3},{1,2,4}}
  {{1,2},{1,3},{1,4},{2,3,4}}
  {{1,2},{2,3},{2,4},{1,3,4}}
  {{1,3},{2,3},{3,4},{1,2,4}}
  {{1,4},{2,4},{3,4},{1,2,3}}
  {{1,2,3},{1,2,4},{1,3,4},{2,3,4}}

Antichains of nonempty, non-singleton sets are A307249.
Minimal covering antichains are A046165.
Maximal intersecting antichains are A007363.
Maximal antichains of nonempty sets are A326359.
Cf. A000372, A003182, A006126, A006602, A014466, A051185, A058891, A261005, A305000, A305844, A326358, A326360, A326361, A326363.

stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
fasmax[y_]:=Complement[y,Union@@(Most[Subsets[#]]&/@y)];
Table[Length[fasmax[stableSets[Subsets[Range[n],{2,n}],Or[Intersection[#1,#2]=={},SubsetQ[#1,#2]]&]]],{n,0,5}]
(* 2nd program *)
n = 2^6; g = CompleteGraph[n]; i = 0;
While[i < n, i++; j = i; While[j < n, j++; If[BitAnd[i, j] == 0 || BitAnd[i, j] == i || BitAnd[i, j] == j, g = EdgeDelete[g, i <-> j]]]];
sets = FindClique[g, Infinity, All];
Length[sets]-Log[2,n]-1 (* Elijah Beregovsky, May 06 2020 *)

For n > 1, a(n) = A326363(n) - n - 1 = A007363(n + 1) - n.

a(7) from Elijah Beregovsky, May 06 2020

A306505 Number of non-isomorphic antichains of nonempty subsets of {1,...,n}.

Original entry on oeis.org

1, 2, 4, 9, 29, 209, 16352, 490013147, 1392195548889993357, 789204635842035040527740846300252679

Offset: 0

Gus Wiseman, Feb 20 2019

The spanning case is A006602 or A261005. The labeled case is A014466.
From Petros Hadjicostas, Apr 22 2020: (Start)
a(n) is the number of "types" of log-linear hierarchical models on n factors in the sense of Colin Mallows (see the emails to N. J. A. Sloane).
Two hierarchical models on n factors belong to the same "type" iff one can obtained from the other by a permutation of the factors.
The total number of hierarchical log-linear models on n factors (in all "types") is given by A014466(n) = A000372(n) - 1.
The name of a hierarchical log-linear model on factors is based on the collection of maximal interaction terms, which must be an antichain (by the definition of maximality).
In his example on p. 1, Colin Mallows groups the A014466(3) = 19 hierarchical log-linear models on n = 3 factors x, y, z into a(3) = 9 types. See my example below for more details. (End)
First differs from A348260(n + 1) - 1 at a(5) = 209, A348260(6) - 1 = 232. - Gus Wiseman, Nov 28 2021

			Non-isomorphic representatives of the a(0) = 1 through a(3) = 9 antichains:
  {}  {}     {}         {}
      {{1}}  {{1}}      {{1}}
             {{1,2}}    {{1,2}}
             {{1},{2}}  {{1},{2}}
                        {{1,2,3}}
                        {{1},{2,3}}
                        {{1},{2},{3}}
                        {{1,3},{2,3}}
                        {{1,2},{1,3},{2,3}}
From _Petros Hadjicostas_, Apr 23 2020: (Start)
We expand _Colin Mallows_'s example from p. 1 of his list of 1991 emails. For n = 3, we have the following a(3) = 9 "types" of log-linear hierarchical models:
Type 1: ( ), Type 2: (x), (y), (z), Type 3: (x,y), (y,z), (z,x), Type 4: (x,y,z), Type 5: (xy), (yz), (zx), Type 6: (xy,z), (yz,x), (zx,y), Type 7: (xy,xz), (yx,yz), (zx,zy), Type 8: (xy,yz,zx), Type 9: (xyz).
For each model, the name only contains the maximal terms. See p. 36 in Wickramasinghe (2008) for the full description of the 19 models.
Strictly speaking, I should have used set notation (rather than parentheses) for the name of each model, but I follow the tradition of the theory of log-linear models. In addition, in an interaction term such as xy, the order of the factors is irrelevant.
Models in the same type essentially have similar statistical properties.
For example, models in Type 7 have the property that two factors are conditionally independent of one another given each level (= category) of the third factor.
Models in Type 6 are such that two factors are jointly independent from the third one. (End)

C. L. Mallows, Emails to N. J. A. Sloane, Jun-Jul 1991, p. 1.
R. I. P. Wickramasinghe, Topics in log-linear models, Master of Science thesis in Statistics, Texas Tech University, Lubbock, TX, 2008, p. 36.
Gus Wiseman, Sequences enumerating clutters, antichains, hypertrees, and hyperforests, organized by labeling, spanning, and allowance of singletons.

Cf. A000372, A003182, A006126, A006602, A014466, A261005, A293606, A293993, A304996, A305000, A305001, A305857, A317674, A319721, A320449, A321679.

Cf. A007363, A306007, A307249, A326358, A326359, A326360, A326363.

a(n) = A003182(n) - 1.

Partial sums of A006602 minus 1.

a(8) from A003182. - Bartlomiej Pawelski, Nov 27 2022

a(9) from A003182. - Dmitry I. Ignatov, Nov 27 2023

A326565 Number of covering antichains of nonempty, non-singleton subsets of {1..n}, all having the same sum.

Original entry on oeis.org

1, 0, 1, 1, 4, 13, 91, 1318, 73581, 51913025

Offset: 0

Gus Wiseman, Jul 13 2019

An antichain is a finite set of finite sets, none of which is a subset of any other. It is covering if its union is {1..n}. The edge-sums are the sums of vertices in each edge, so for example the edge sums of {{1,3},{2,5},{3,4,5}} are {4,7,12}.

			The a(2) = 1 through a(5) = 13 antichains:
  {{1,2}}  {{1,2,3}}  {{1,2,3,4}}      {{1,2,3,4,5}}
                      {{1,4},{2,3}}    {{1,2,5},{1,3,4}}
                      {{2,4},{1,2,3}}  {{1,3,5},{2,3,4}}
                      {{3,4},{1,2,4}}  {{1,4,5},{2,3,5}}
                                       {{1,4,5},{1,2,3,4}}
                                       {{2,3,5},{1,2,3,4}}
                                       {{2,4,5},{1,2,3,5}}
                                       {{3,4,5},{1,2,4,5}}
                                       {{1,5},{2,4},{1,2,3}}
                                       {{2,5},{3,4},{1,2,4}}
                                       {{3,5},{1,2,5},{1,3,4}}
                                       {{4,5},{1,3,5},{2,3,4}}
                                       {{1,4,5},{2,3,5},{1,2,3,4}}

Cf. A000372, A006126, A035470, A307249, A321455, A321717, A321718, A326360, A326518, A326534, A326566.

stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
cleq[n_]:=Select[stableSets[Subsets[Range[n],{2,n}],SubsetQ[#1,#2]||Total[#1]!=Total[#2]&],Union@@#==Range[n]&];
Table[Length[cleq[n]],{n,0,5}]

a(9) from Andrew Howroyd, Aug 14 2019

A348260 Number of inequivalent maximal antichains of the Boolean lattice on a set of n elements.

Original entry on oeis.org

1, 2, 3, 5, 10, 30, 233, 35925

Offset: 0

Dmitry I. Ignatov, Oct 13 2021

a(n) is the number of orbits for the corresponding families of maximal antichains (see also A326358) of the powerset of {1,2,...,n} under the action of the symmetry group S_n.

			The a(0)=1 maximal antichains is {}.
The a(1)=2 maximal antichains are {}, {1}.
The a(2)=3 maximal antichains {}, {1}{2}, {12}.
Representatives of the a(3)=5 maximal antichains are: {}, {1}{2}{3}, {12}{3}, {12}{13}{23}, {123}.
Representatives of the a(4)=10 maximal antichains are:
   {},                       {1}{2}{3}{4},
   {12}{3}{4},               {12}{13}{23}{4},
   {123}{4},                 {12}{13}{24}{14}{24}{34},
   {123}{14}{24}{34},        {123}{124}{34},
   {123}{124}{134}{234},     {1234}.

Dmitry I. Ignatov, On the Number of Maximal Antichains in Boolean Lattices for n up to 7. Lobachevskii J. Math., 44 (2023), 137-146.
Dmitry I. Ignatov, Supporting iPython code and input files for generating and counting inequivalent maximal antichains for n up to 7 and related sequences, Github repository, sections 0,1,4
Dmitry I. Ignatov, Supporting iPython notebook: A348260.ipynb
Dmitry I. Ignatov, PDF of the supporting iPython notebook

Cf. A003182 (not necessarily maximal), A326358 (labeled case).

Cf. A326359, A326360.

cp's OEIS Frontend

A326358 Number of maximal antichains of subsets of {1..n}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Mathematica

Formula

Extensions

A326363 Number of maximal intersecting antichains of subsets of {1..n}.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A326359 Number of maximal antichains of nonempty subsets of {1..n}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A326361 Number of maximal intersecting antichains of sets covering n vertices with no singletons.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A326362 Number of maximal intersecting antichains of nonempty, non-singleton subsets of {1..n}.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A306505 Number of non-isomorphic antichains of nonempty subsets of {1,...,n}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A326565 Number of covering antichains of nonempty, non-singleton subsets of {1..n}, all having the same sum.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A348260 Number of inequivalent maximal antichains of the Boolean lattice on a set of n elements.

Views