2018
DOI: 10.1016/j.jfa.2017.11.002
|View full text |Cite
|
Sign up to set email alerts
|

A Helson matrix with explicit eigenvalue asymptotics

Abstract: Abstract. A Helson matrix (also known as a multiplicative Hankel matrix) is an infinite matrix with entries {a(jk)} for j, k ≥ 1. Here the (j, k)'th term depends on the product jk. We study a self-adjoint Helson matrix for a particular sequence a(j) = ( √ j log j(log log j) α )) −1 , j ≥ 3, where α > 0, and prove that it is compact and that its eigenvalues obey the asymptotics λ n ∼ κ(α)/n α as n → ∞, with an explicit constant κ(α). We also establish some intermediate results (of an independent interest) which… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…The multiplicative Hilbert matrix M p is related to the study of the theory of Hardy spaces of Dirichlet series and Riemann zeta function. See [2], [3] , [4], [6] for some recent results of this topic. We will call H p multiplicative Hilbert operator.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…The multiplicative Hilbert matrix M p is related to the study of the theory of Hardy spaces of Dirichlet series and Riemann zeta function. See [2], [3] , [4], [6] for some recent results of this topic. We will call H p multiplicative Hilbert operator.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…In [11], some norm bounds relating K and K were considered for Hankel kernels, i.e. k(x, y) = h(x + y).…”
Section: Theorem Bmentioning
confidence: 99%
“…We also relate this result to the well known unitary equivalence between Hankel matrices and integral Hankel operators. This paper appeared as an attempt to consider one of the technical ingredients of [5] on a more systematic basis. Theorem 1.1 and its proof is based on the same set of ideas as [5,Theorem 3.2].…”
Section: 2mentioning
confidence: 99%
“…This paper appeared as an attempt to consider one of the technical ingredients of [5] on a more systematic basis. Theorem 1.1 and its proof is based on the same set of ideas as [5,Theorem 3.2].…”
mentioning
confidence: 99%