A lower bound for the number of pinned angles determined by a Cartesian product set
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929380355211264 |
|---|---|
| author | Roche-Newton, Oliver |
| author_facet | Roche-Newton, Oliver |
| contents | We prove that, for any $B \subset \mathbb R$, the Cartesian product set $B \times B$ determines $Ω(|B|^{2+c})$ distinct angles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_06206 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A lower bound for the number of pinned angles determined by a Cartesian product set Roche-Newton, Oliver Combinatorics Number Theory We prove that, for any $B \subset \mathbb R$, the Cartesian product set $B \times B$ determines $Ω(|B|^{2+c})$ distinct angles. |
| title | A lower bound for the number of pinned angles determined by a Cartesian product set |
| topic | Combinatorics Number Theory |
| url | https://arxiv.org/abs/2406.06206 |