Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2403.09943 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914715435794432 |
|---|---|
| author | Williams, Kada |
| author_facet | Williams, Kada |
| contents | Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of elements from a given subset. Our versatile approach is proven valid under the condition of the set size exceeding the cube of the radius. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_09943 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Width of a Ball in a Hypercube Williams, Kada Combinatorics Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of elements from a given subset. Our versatile approach is proven valid under the condition of the set size exceeding the cube of the radius. |
| title | The Width of a Ball in a Hypercube |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.09943 |