2015
DOI: 10.1007/s40993-015-0010-x
|View full text |Cite
|
Sign up to set email alerts
|

Lacunary recurrences for Eisenstein series

Abstract: Using results from the theory of modular forms, we reprove and extend a result of Romik about lacunary recurrence relations for Eisenstein series.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…It turns out that the identity j α n,j = 1 is still correct in that case, and this is both easier and more natural to prove. That is, we now wish to show that S(n) := n k=0 F (n, k) = 1 (32) for all integer n ≥ 0, where we define…”
Section: Bernoulli Numbersmentioning
confidence: 99%
See 1 more Smart Citation
“…It turns out that the identity j α n,j = 1 is still correct in that case, and this is both easier and more natural to prove. That is, we now wish to show that S(n) := n k=0 F (n, k) = 1 (32) for all integer n ≥ 0, where we define…”
Section: Bernoulli Numbersmentioning
confidence: 99%
“…Update added in revision: following our description of this problem in the original version of this paper, a proof of (23) based on known results about modular forms was found recently by Mertens and Rolen[32].…”
mentioning
confidence: 93%
“…The speed of the computation increases with the size of the gap. Lacunary recurrences have been studied for many types of sequences including Bernoulli numbers [1,8,9,11], Euler numbers [8], k-Fibonacci numbers (which are Fibonacci polynomials at positive integer values) [4], Eisenstein series [10], Tribonacci numbers [6], more general sequences that include Bernoulli, Euler, Fibonacci and Genocchi numbers [5], and sequences satisfying an arbitrary linear recurrence [3,12,13].…”
Section: Introductionmentioning
confidence: 99%