Sizes of flat maximal antichains of subsets

02/14/2023
by   Jerrold R. Griggs, et al.
0

This is the second of two papers investigating for which positive integers m there exists a maximal antichain of size m in the Boolean lattice B_n (the power set of [n]:={1,2,…,n}, ordered by inclusion). In the first part, the sizes of maximal antichains have been characterized. Here we provide an alternative construction with the benefit of showing that almost all sizes of maximal antichains can be obtained using antichains containing only l-sets and (l+1)-sets for some l.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2021

Maximal antichains of subsets II: Constructions

This is the second in a sequence of three papers investigating the quest...
research
10/01/2019

Initial Steps in the Classification of Maximal Mediated Sets

Maximal mediated sets (MMS), introduced by Reznick, are distinguished su...
research
06/04/2021

Maximal antichains of subsets I: The shadow spectrum

Extending a classical theorem of Sperner, we investigate the question fo...
research
02/09/2019

Approximation of subsets of natural numbers by c.e. sets

The approximation of natural numbers subsets has always been one of the ...
research
11/14/2012

Gap Processing for Adaptive Maximal Poisson-Disk Sampling

In this paper, we study the generation of maximal Poisson-disk sets with...
research
10/06/2021

Lattice paths with a first return decomposition constrained by the maximal height of a pattern

We consider the system of equations A_k(x)=p(x)A_k-1(x)(q(x)+∑_i=0^k A_i...
research
03/09/2018

Listing Maximal Subgraphs in Strongly Accessible Set Systems

Algorithms for listing the subgraphs satisfying a given property (e.g.,b...

Please sign up or login with your details

Forgot password? Click here to reset