 |
WEEKLY CALENDAR |
| Monday 11 | 4:10-5:30 pm, room 1432. Subfactor Seminar. Paramita Das, Vanderbilt University. A new construction of subfactors from random matrix theory II. |
| Tuesday 12 |
4:10-5:00 pm, room 1310.
Computational
Analysis Seminar. Justin Romberg, Georgia Tech. Compressed Sensing for Next-Generation Signal Acquisition. From decades of research in signal processing, we have learned that
having a good signal representation can be key for tasks such as
compression, denoising, and restoration. The new theory of Compressed
Sensing (CS) shows us how a good representation can fundamentally aid
us in the acquisition (or sampling) process as well. In this talk will
outline the main theoretical results in CS and discuss how the ideas
can be applied in next-generation acquisition devices. The CS paradigm
can be summarized neatly: the number of measurements (e.g., samples)
needed to acquire a signal or image depends more on its inherent
information content than on the desired resolution (e.g., number of
pixels). The CS theory typically requires a novel measurement scheme
that generalizes the conventional signal acquisition process: instead
of making direct observations of the signal, for example, an
acquisition device encodes it as a series of random linear projections. The theory of CS, while still in its developing stages, is far-
reaching and draws on subjects as varied as sampling theory, convex
optimization, source and channel coding, statistical estimation,
uncertainty principles, and harmonic analysis. The applications of CS
range from the familiar (imaging in medicine and radar, high-speed
analog-to-digital conversion, and super-resolution) to truly novel
image acquisition and encoding techniques.
4:10-5:15 pm, room 1432. Noncommutative Geometry Seminar. Erik Guentner, University of Hawaii at Manoa. Approximation in group C*-algebras (part 2). 4:10-5:30 pm, room 1432. Universal Algebra and Logic Seminar. Ciro Russo, Vanderbilt University. Propositional deductive systems: hidden interpretability, fragments and equivalence. The interpretability of one logic into another is a very common issue in Mathematical Logic but, as far as we know, a precise and general definition of the concept of "interpretation" is still lacking, the meaning of this word usually relying on a logician's intuition. We propose a general and purely syntactic definition of interpretability for the case of propositional deductive systems. Then we generalize this definition, together with the notions of equivalence of deductive systems and a fragment of a logic, to corresponding "hidden" notions. Such generalizations are amenable to an algebraic characterization that, under additional hypotheses, yield results for the corresponding non-hidden notions. 7-8 pm, room 1206. Undergraduate Seminar in Mathematics. Justin Fitzpatrick, Vanderbilt University. Combinatorics: Pascal's Triangle and More. Ever wonder where the numbers in Pascal's Triangle come from, or why they work out so nicely? In this talk, we'll look at some basic techniques of counting by combinations and permutations and see how they lead us to some interesting results including the binomial theorem, which is the source of the numbers in Pascal's famous triangle. Free pizza. |
| Wednesday 13 | |
| Thursday 14 | 4:10-5 pm, room 5211. Colloquium. Carlos Cabrelli, University of Buenos Aires. Optimal shift invariant spaces. Shift invariant spaces are spaces of functions that are invariant under integer translates. They are important in many areas, in particular in approximation theory, numerical analysis and wavelet theory. They also serve as models for signal and image processing applications as well as sampling theory. Their very rich and interesting mathematical structure can be successfully exploited in many problems. In this talk we will try to describe part of this structure and give and application to the problem of finding the "best fitting" shift invariant space for a given set of data. Tea at 3:30 pm in SC 1425. |
| Friday 15 |
4:10 pm, room 1307. Partial Differential Equations Seminar. Mikhail Perepelitsa, Vanderbilt University. Some problems in the theory of Compressible Navier-Stokes Equations.
4:10-5 pm, room 1310. NCGOA Research Training Group Seminar. Bogdan Nica, Vanderbilt University. Stable ranks. |