A Relationship for LYM Inequalities between Boolean Lattices and Linear Lattices with Applications
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914707925893120 |
|---|---|
| author | Liu, Jiuqiang Yu, Guihai |
| author_facet | Liu, Jiuqiang Yu, Guihai |
| contents | Sperner theory is one of the most important branches in extremal set theory. It has many applications in the field of operation research, computer science, hypergraph theory and so on. The LYM property has become an important tool for studying Sperner property. In this paper, we provide a general relationship for LYM inequalities between Boolean lattices and linear lattices. As applications, we use this relationship to derive generalizations of some well-known theorems on maximum sizes of families containing no copy of certain poset or certain configuration from Boolean lattices to linear lattices, including generalizations of the well-known Kleitman theorem on families containing no $s$ pairwise disjoint members (a non-uniform variant of the famous Erdős matching conjecture) and Johnston-Lu-Milans theorem and Polymath theorem on families containing no $d$-dimensional Boolean algebras. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_04817 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Relationship for LYM Inequalities between Boolean Lattices and Linear Lattices with Applications Liu, Jiuqiang Yu, Guihai Combinatorics Sperner theory is one of the most important branches in extremal set theory. It has many applications in the field of operation research, computer science, hypergraph theory and so on. The LYM property has become an important tool for studying Sperner property. In this paper, we provide a general relationship for LYM inequalities between Boolean lattices and linear lattices. As applications, we use this relationship to derive generalizations of some well-known theorems on maximum sizes of families containing no copy of certain poset or certain configuration from Boolean lattices to linear lattices, including generalizations of the well-known Kleitman theorem on families containing no $s$ pairwise disjoint members (a non-uniform variant of the famous Erdős matching conjecture) and Johnston-Lu-Milans theorem and Polymath theorem on families containing no $d$-dimensional Boolean algebras. |
| title | A Relationship for LYM Inequalities between Boolean Lattices and Linear Lattices with Applications |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.04817 |