On Completely multiplicative $\pm1$ sequences that omit many consecutive $+1$ values
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_ | 1866909163114725376 |
|---|---|
| author | You, Yichen |
| author_facet | You, Yichen |
| contents | We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea of the "rotation trick" and such an extension can be quantified by the number of modified primes. Under the assumption of Elliott's conjecture, this method allows us to construct length-$k$ functions systematically for $k\geq 4$ which generalizes the work of I. Schur for $k = 2$ and R. Hudson for $k =3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_04981 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On Completely multiplicative $\pm1$ sequences that omit many consecutive $+1$ values You, Yichen Number Theory We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea of the "rotation trick" and such an extension can be quantified by the number of modified primes. Under the assumption of Elliott's conjecture, this method allows us to construct length-$k$ functions systematically for $k\geq 4$ which generalizes the work of I. Schur for $k = 2$ and R. Hudson for $k =3$. |
| title | On Completely multiplicative $\pm1$ sequences that omit many consecutive $+1$ values |
| topic | Number Theory |
| url | https://arxiv.org/abs/2404.04981 |