The Width of Hamming Balls
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909376226263040 |
|---|---|
| author | Williams, Kada |
| author_facet | Williams, Kada |
| contents | The width of a poset is the size of its largest antichain. Sperner's theorem states that $(2^{[n]},\subset)$ is a poset whose width equals the size of its largest layer. We show that Hamming ball posets also have this property. This extends earlier work that proves this in the case of small radii. Our proof is inspired by (and corrects) a result of Harper. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01496 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Width of Hamming Balls Williams, Kada Combinatorics The width of a poset is the size of its largest antichain. Sperner's theorem states that $(2^{[n]},\subset)$ is a poset whose width equals the size of its largest layer. We show that Hamming ball posets also have this property. This extends earlier work that proves this in the case of small radii. Our proof is inspired by (and corrects) a result of Harper. |
| title | The Width of Hamming Balls |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.01496 |