2022
DOI: 10.1353/ajm.2022.0022
|View full text |Cite
|
Sign up to set email alerts
|

The matrix Bochner problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(20 citation statements)
references
References 0 publications
0
20
0
Order By: Relevance
“…Now by Refs. [10] and [39, Lemma 1], we get M(Γ 𝑛 − 𝜆) = 0 for all 𝑛 ∈ ℕ 0 , and since (Γ 𝑛 − 𝜆) is invertible for all 𝑛 ∈ ℕ 0 we obtain M = 0. □…”
Section: Fourier Algebrasmentioning
confidence: 86%
See 4 more Smart Citations
“…Now by Refs. [10] and [39, Lemma 1], we get M(Γ 𝑛 − 𝜆) = 0 for all 𝑛 ∈ ℕ 0 , and since (Γ 𝑛 − 𝜆) is invertible for all 𝑛 ∈ ℕ 0 we obtain M = 0. □…”
Section: Fourier Algebrasmentioning
confidence: 86%
“…Next, we adapt the construction of the Fourier algebras given in Ref. [10, Definition 2.20] to our setting. Definition Given a sequence of matrix‐valued polynomials (Qnfalse(xfalse))ndouble-struckN0$(Q_n(x))_{n\in \mathbb {N}_0}$, we define scriptFLfalse(Qfalse)=false{MNN:scriptDMN,0.16emM·Qgoodbreak=Q·scriptDfalse}scriptNN,scriptFRfalse(Qfalse)=false{scriptDMN:MNN,0.16emM·Qgoodbreak=Q·scriptDfalse}scriptMN.$$\begin{equation} \begin{split} \mathcal {F}_L(Q)&=\lbrace M\in \mathcal {N}_N: \exists \mathcal {D}\in \mathcal {M}_N,\, M\cdot Q = Q\cdot \mathcal {D}\rbrace \subset \mathcal {N}_{N},\\ \mathcal {F}_R(Q)&=\lbrace \mathcal {D}\in \mathcal {M}_N: \exists M\in \mathcal {N}_N,\, M\cdot Q = Q\cdot \mathcal {D}\rbrace \subset \mathcal {M}_{N}.…”
Section: Fourier Algebrasmentioning
confidence: 99%
See 3 more Smart Citations