Direkt zum Inhalt Direkt zur Navigation

# 2009

Eine Ebene höher
23.07.2009
Lahcen Maniar (Marrakesch)
S10, 14:15-16:00
AG Funktionalanalysis
09.07.2009
Nazife Erkursun (Ankara/Ulm)
S10, 15:15-17:00
AG Funktionalanalysis
09.07.2009
Ulrich Groh (Tübingen)
S10, 14:15-16:00
AG Funktionalanalysis
25.06.2009
Tatiana Shulman (Copenhagen)
S10, 14:15-16:00
AG Funktionalanalysis
14.05.2009
Daniel Maier (Tuebingen)
S10, 14:15-16:00
AG Funktionalanalysis
07.05.2009
Annette Kopp (Tübingen)
S10, 14:15-16:00
AG Funktionalanalysis
30.04.2009
Retha Heymann (University of Stellenbosch)

Fredholm operators are characterized by Atkinson’s theorem. By Atkinson’s
theorem, a bounded linear operator on a Banach space X is Fredholm, if and
only if this operator modulo the compact operators is invertible in the Calkin
algebra. This result was used by R. Harte to generalize the concept of Fredholm
operators in L(X) to Fredholm elements in Banach algebras in general. Furthermore,
this led to the introduction of Weyl and Browder elements. In this
talk we will look at this generalization as well as some related results of Harte.

S10, 14:15-16:00
AG Funktionalanalysis
19.02.2009
Alberto Conejero (Valencia)
A strongly continuous semigroup is said to be hypercyclic if there exists some element whose orbit under the semigroup is dense,and it is said to be chaotic if it is hypercyclic and it has a dense set of periodic points.Similar definitions could also be stated for the sequence of powers of a single operator in the semigroup.In this talk we explain what can be said about the dynamics of single operators in a hypercyclic, resp. chaotic C0-semigroup.
S10, 14:15-16:00
AG Funktionalanalysis
09.02.2009
Sophie Fosson (Torin)

Recovering the input of a system from a noisy lecture of the output is both a typical inverse ill-posed problem and a transmission paradigm. If the input-output relation is given by a convolution integral, we are concerned with the well-known deconvolution problem, which occurs in several scientific frameworks.When the deconvolution system is discrete, i.e. its input is quantized and the output is sampled, we can develop an original information-theoretic analysis and design an encoding-decoding scheme to tackle it. We propose different decoding methods to identify the input, focussing on a particular class of suboptimal, causal algorithms achieving good performance. These algorithms can be theoretically described by means of Markov Processes and Ergodic Theory.

S10, 14:15-16:00
AG Funktionalanalysis
05.02.2009
Donald I. Cartwright (Sydney)
I shall be talking about some joint work I did withWolfgang Woess (Graz). We consider a countable connected graph, view it as a one-complex X1,and define the natural operator A which averagesfunctions over balls of radius 1. Our results include thecalculation of the spectrum of this operator on L2(X1).
S10, 17:15-19:00
AG Funktionalanalysis
22.01.2009
Shangquan Bu (Beijing)
S10, 15:15-17:00
AG Funktionalanalysis
08.01.2009
Anke Kalauch (Dresden)
S10, 14:15-16:00
AG Funktionalanalysis
30.12.2008
Klaus Engel (L'Aquila)
S10, 10:15-12:00
AG Funktionalanalysis
« Mai 2013 »
So Mo Di Mi Do Fr Sa
1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31