New upper bounds for the size of set systems with restricted intersections modulo prime powers
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912178238390272 |
|---|---|
| author | Hegedüs, Gábor |
| author_facet | Hegedüs, Gábor |
| contents | Let $q=p^α$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$.
Our proof is based on the linear algebra bound method and basic number theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_02925 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | New upper bounds for the size of set systems with restricted intersections modulo prime powers Hegedüs, Gábor Combinatorics 05D05, 12D99, 15A03 Let $q=p^α$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof is based on the linear algebra bound method and basic number theory. |
| title | New upper bounds for the size of set systems with restricted intersections modulo prime powers |
| topic | Combinatorics 05D05, 12D99, 15A03 |
| url | https://arxiv.org/abs/2501.02925 |