2020
DOI: 10.1007/s11139-019-00216-2
|View full text |Cite
|
Sign up to set email alerts
|

Congruences modulo primes of the Romik sequence related to the Taylor expansion of the Jacobi theta constant $$\theta _3$$

Abstract: Recently, Romik determined in [8] the Taylor expansion of the Jacobi theta constant θ 3 , around the point x = 1. He discovered a new integer sequence, (d(n)) ∞ n=0 = 1, 1, −1, 51, 849, −26199, . . . , from which the Taylor coefficients are built, and conjectured that the numbers d(n) satisfy certain congruences. In this paper, we prove some of these conjectures, for example that d(n) ≡ (−1) n+1 (mod 5) for all n ≥ 1, and that for any prime p ≡ 3 (mod 4), d(n) vanishes modulo p for all large enough n.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
14
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 8 publications
0
14
0
Order By: Relevance
“…We note that θ 2 (z) = 2e πiz 4 ψ(e 2πiz ) and θ 3 (z) = ϕ(e πiz ), where ψ and ϕ are defined in [1, pp. 323 From (10) and ∂Θ(i/2) = 0, we have that…”
Section: Proofs Of Theorems 13 and 14mentioning
confidence: 99%
See 1 more Smart Citation
“…We note that θ 2 (z) = 2e πiz 4 ψ(e 2πiz ) and θ 3 (z) = ϕ(e πiz ), where ψ and ϕ are defined in [1, pp. 323 From (10) and ∂Θ(i/2) = 0, we have that…”
Section: Proofs Of Theorems 13 and 14mentioning
confidence: 99%
“…around τ 0 = i (we refer to [8], [10], [2], [15], and [16]). Romik defined (d(n)) ∞ n=0 to be the sequence such that…”
mentioning
confidence: 99%
“…This triply nested definition makes it rather unwieldy to work with the Taylor coefficients directly, though Romik conjectured several nice properties of the d(n) coefficients modulo any prime. This paper is dedicated towards refining the second half of Romik's conjecture, which was proven by the combined efforts of Scherer [8] and Guerzhoy-Mertens-Rolen [3]. Guerzhoy, Mertens, and Rolen in fact prove a stronger statement in the context of an arbitrary half integer weight modular form.…”
Section: Introductionmentioning
confidence: 99%
“…This encodes more arithmetic information, and on iterating this p − 1 times we see that d(n) is periodic with period (p−1) 2 2 , which is not necessarily minimal. The proof structure is tripartite: (1) show that u(n), v(n) ≡ 0 (mod p) for n ≥ p+1 2 , a result conjectured in Scherer's paper [8]; (2) use this to simplify the expression for s(n, k) (mod p);…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation