SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES

SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES

For a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of  \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set. If \(U\) is the singleton poset, then \(S(U,n)\) was determined by E. Spe...

Full description

Saved in:
Bibliographic Details
Main Author: Gábor Czédli
Format: Article
Language:English
Published: Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics 2024-07-01
Series:Ural Mathematical Journal
Subjects:
sperner theorem for partially ordered sets, antichain of posets, unrelated copies of a poset, incomparable copies of a poset, distributive lattice, smallest generating set, minimum-sized generating set, cryptography with lattices
Online Access:https://umjuran.ru/index.php/umj/article/view/668
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://umjuran.ru/index.php/umj/article/view/668

Similar Items