EUVIMEDEUVIMED entdecken
Crossref

Szemerédi's theorem, frequent hypercyclicity and multiple recurrence

George Costakis, Ioannis Parissis

MATHEMATICA SCANDINAVICA · 01.06.2012 · 110 (2) · 251

DOI: 10.7146/math.scand.a-15207 ↗

Kurz gefasst

Fachartikel in der Zeitschrift MATHEMATICA SCANDINAVICA, online erschienen am 01.06.2012. Verfasst von George Costakis und 1 weiteren Autor:innen. Die Arbeit wurde bisher 44-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let $T$ be a bounded linear operator acting on a complex Banach space $X$ and $(\lambda_n)_{n\in\mathsf{N}}$ a sequence of complex numbers. Our main result is that if $|\lambda_n|/|\lambda_{n+1}|\to 1$ and the sequence $(\lambda_n T^n)_{n\in\mathsf{N}}$ is frequently universal then $T$ is topologically multiply recurrent. To achieve such a result one has to carefully apply Szemerédi's theorem in arithmetic progressions. We show that the previous assumption on the sequence $( \lambda_n)_{n\in\mathsf{N}}$ is optimal among sequences such that $|\lambda_{n}|/|\lambda_{n+1}|$ converges in $[0,\infty]$. In the case of bilateral weighted shifts and adjoints of multiplication operators we provide characterizations of topological multiple recurrence in terms of the weight sequence and the symbol of the multiplication operator respectively.

Zitieren

APA

Costakis, G., & Parissis, I. (2012). Szemerédi's theorem, frequent hypercyclicity and multiple recurrence. MATHEMATICA SCANDINAVICA, 110(2), 251. https://doi.org/10.7146/math.scand.a-15207

Vancouver

Costakis G, Parissis I. Szemerédi's theorem, frequent hypercyclicity and multiple recurrence. MATHEMATICA SCANDINAVICA. 2012;110(2):251. doi:10.7146/math.scand.a-15207

BibTeX
@article{Costakis2012,
  author = {Costakis, George and Parissis, Ioannis},
  title = {Szemerédi's theorem, frequent hypercyclicity and multiple recurrence},
  journal = {MATHEMATICA SCANDINAVICA},
  year = {2012},
  volume = {110},
  number = {2},
  pages = {251},
  doi = {10.7146/math.scand.a-15207}
}
Kostenlos starten →