The Florida State University
The Florida State University
Monday: 28 October 1996
Info on Special Saturday Graduate Seminar, 3:35 p.m., 102 Love Building
Tuesday: 30 October 1996
Hopf Algebra Seminar, 2:00 p.m., 104 Love Building
Knot Theory Seminar, 3:35 p.m., 104 Love Building
Wednesday: 31 October 1996
(Real) Analysis Seminar, 2:30 p.m., 102 Love Building
Complex/Symbolic Analysis Coffee, 3:30 p.m., 105 Love Building
Complex/Symbolic Analysis Seminar, 3:35 p.m., 102 Love Building
Algebra Seminar, 2:00 p.m., 104 Love Building
Applied Seminar, 3:30 p.m., 200 Love Building
Topology Tea Time, 3:00 p.m., 204 Love Building
Topology Seminar, 3:35 p.m., 104 Love Building
Friday: 25 October 1996
Colloquium Coffee, 3:00 p.m., 204 Love Building
Colloquium, 3:30 p.m., 101 Love Building
No Scientific Computing Seminar, 4:30 p.m., 200 Love Building
This document is maintained by
Melissa Elaine Smith /
smith@math.fsu.edu
Last modified: 29 August 1996
Composed objects arise very naturally in hierarchical/modular modeling of physical/computer systems. In essence the interfacing of layers (modules) corresponds to function composition.
In this talk, we show how to efficiently carry out several fundamental computations (in computer algebra) on composed objects, taking advantage of their composition structures.
In particular, we will illustrate this idea for two fundamental computer algebraic objects: Subresultants and Groebner basis.
Similar interpolation problems can be posed for functions of several complex variables, leading to open questions. New methods in functional analysis provide answers, but those come in terms of a theory of Hankel operators in product spaces (e.g., in the polydisk) that is surprisingly different to that in one variable (e.g., in the disk).
Graduate Student Seminar: Coming Attractions
Tuesday Algebra Seminar: Coming Attractions
Hopf Algebra Seminar: Coming Attractions
Knot Theory Seminar: Coming Attractions
(Real) Analysis Seminar: Coming Attractions
Complex/Symbolic Analysis Seminar: Coming Attractions
Thursday Algebra Seminar: Coming Attractions
Applied Seminar: Coming Attractions
Topology Seminar: Coming Attractions
Scientific Computing Seminar: Coming Attractions
Hoon Hong
Computing with Composed Objects
A composed object is the one that is made of several objects. For example, let A(x,y), B(x,y) and C(x,y) be function objects. By composing of A with B and C, we obtain the composed object: A'(x,y) = A(B(x,y),C(x,y)).
(go back to twim)
Abstracts
Cora Sadosky
Interpolation in the Disk and the Polydisk
The classical problems of interpolation and approximation by analytic functions were posed and solved at the beginning of the century by Pick, Nevanlinna, Caratheodory, Fejer and Schur. These same problems and others admit unified solutions through operator theoretic methods that allow their generalizations to matrix-valued analytic functions of one variable. Such an improvement provides important applications to signal processing and control theory, and accounts for the current interest in the study of Hankel operators.
(go back to twim)
04 November....
18 November....
02 December....
(go back to twim)
(go back to twim)
(go back to twim)
(go back to twim)
(go back to twim)
(go back to twim)
(go back to twim)
07 November....
14 November....
21 November....
28 November....Thanksgiving --- no classes
05 December....
(go back to twim)
07 November....Ivo Dinov, Florida State University
14 November....Ivo Dinov, Florida State University
21 November....Jack Quine, Florida State University
28 November....Thanksgiving --- no classes
05 December....Jack Quine, Florida State University
(go back to twim)
08 November....Lighthill Symposium, no seminar
15 November....David Kopriva, An Unstructured Mortar Spectral Multi-Domain Method for the Compressible Navier-Stokes Equations
(go back to twim)
Scheduled Colloquia Speakers - Fall 1996
15 November....Jouko Vaananen, Academy of Finland & Univ of Helsinki
Logic and Mathematics---from Cantor to Shelah
I discuss the role of logic in mathematics in the light of both
classical and recent advances in mathematical logic. The concepts and
methods of logic have helped us to understand, for example, why
Cantor's Continuum Hypothesis, and algorithmic solution of Diophantine
equations (Hilbert's 1st and 10th problems), are hard or impossible to
solve. On the other hand, the logical analysis of mathematical
structures has uncovered a rich general theory of classes of
structures with a so called complete first order axiomatization. The
most beautiful manifestation of this is S. Shelah's Classification
Theory, the most famous result of which can be summarized as follows:
Classes of structures with a complete first order axiomatization
always contain either maximally many structures, which are moreover
indistinguishable from each other, or rather few structures, all
easily distinguishable from each other.
22 November....Gaston Gonnet (ETH, Zuerich)
22 November....Thanksgiving --- no classes
06 December....
(go back to twim)
Scheduled Colloquia Speakers - Spring 1997
17 January....
24 January....
31 January....J. Bona
07 February...R. Vogt
14 February...
21 February...M. Barnsley
28 February...
07 March......S. Wittington
14 March......Spring Break
21 March......
28 March......
04 April......
11 April......
18 April......
(go back to twim)
Returnto Main Menu