Computability, randomness and applications / Calculabilité, hasard et leurs applications

Collection Computability, randomness and applications / Calculabilité, hasard et leurs applications

Organizer(s) Bienvenu, Laurent ; Jeandel, Emmanuel ; Porter, Christopher
Date(s) 20/06/2016 - 24/06/2016
linked URL http://conferences.cirm-math.fr/1408.html
00:00:00 / 00:00:00
2 5

Carleson's Theorem and Schnorr randomness

By Johanna Franklin

Also appears in collection : Exposés de recherche

Carleson's Theorem states that for $1 < p < \infty$, the Fourier series of a function $f$ in $L^p[-\pi,\pi]$ converges to $f$ almost everywhere. We consider this theorem in the context of computable analysis and show the following two results. (1) For a computable $p > 1$, if $f$ is a computable vector in $L^p[?\pi,\pi]$ and $t_0 \in [-\pi,\pi]$ is Schnorr random, then the Fourier series for $f$ converges at $t_0$. (2) If $t_0 \in [-\pi,\pi]$ is not Schnorr random, then there is a computable function $f : [-\pi,\pi] \rightarrow \mathbb{C}$ whose Fourier series diverges at $t_0$. This is joint work with Timothy H. McNicholl, and Jason Rute.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19005403
  • Cite this video Franklin, Johanna (21/06/2016). Carleson's Theorem and Schnorr randomness. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19005403
  • URL https://dx.doi.org/10.24350/CIRM.V.19005403

Bibliography

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback