Showing math.COShow all
2 papers · 1 filter
math.CO2023
Minimum-sized generating sets of the direct powers of free distributive lattices
Gábor Czédli
For a finite lattice , let Gm() denote the least such that can be generated by elements. For integers and , denote by FD the -th direct power…
math.CO2023
Sperner theorems for unrelated copies of some partially ordered sets in a powerset lattice and minimum generating sets of powers of distributive lattices
Gábor Czédli
For a finite poset (partially ordered set) and a natural number , let Sp denote the largest number of pairwise unrelated copies of in the powerset lattice (AKA su…